Search Results for author:
Found 3 papers, 2 papers with code
Scalable Community Detection via Parallel Correlation Clustering
Our empirical evaluation shows that this framework improves the state-of-the-art trade-offs between speed and quality of scalable community detection.
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time
For this variant, this is the first exact algorithm that runs in subquadratic time, as long as $m=n^{2-\epsilon}$ for some constant $\epsilon > 0$.
Random road networks: the quadtree model
What does a typical road network look like?
Discrete Mathematics Social and Information Networks
Cannot find the paper you are looking for? You can
Submit a new open access paper.
