maxdan94 Goto Github PK
Name: Maximilien Danisch
Type: User
Company: LIP6 UPMC
Bio: My research interests revolve around the study of very large real-world graphs.
Location: Paris
Blog: http://bit.ly/danisch
Name: Maximilien Danisch
Type: User
Company: LIP6 UPMC
Bio: My research interests revolve around the study of very large real-world graphs.
Location: Paris
Blog: http://bit.ly/danisch
Efficient C implementation of the auction algorithm of Bertsekas for the assignement problem
C implementation of bucket_sort and arg_bucket_sort
C code related to the computation of communitiy cores
Compute the cosine similarity between each pair of nodes in very large directed graphs
Recursive graph cuts to obtain an ordering of nodes
This repository includes Lecture Notes and Lab Exercises in Python for a course named "Data Analysis (for Networks)" taught at Sorbonne University. In case you want to use the slides please contact me.
C implementation of algorithms to find the Density-Friendly graph decomposition
C code to break the structure of a real-world graph
Divisive Hierarchical Clustering
C code to compute a similarity score between two overlapping community structures
Some local search algorithms to compute cuts in large sparse graphs
C code to compute a Heaviest k-Subgraph or an approximation
Maximum independent sets of large sparse graphs.
Algorithms to list k-cliques in real-world graphs
Efficient implementation of Kruskal's algorithm using a UnionFind datastruture
A C implementation of a Boldi-Vigna graph decompressor
Loading a graph in main memory
Implementation of a scalable embedding method suggested in WSDM2020
Linear programming formulation of mincut solved with MOSEK
Efficient C implementation of the Ford-Fulkerson maxflow algorithm
C code to compute all overlapping communities in a network following a "from local to global approach"
These C programs computes some neighborhood-based similarities between each pair of nodes in a very large sparse graph.
An open implementation of the MC family of maximum clique algorithms
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.