Cited in
(25)- Engineering a combinatorial Laplacian solver: lessons learned
- Fast approximation of betweenness centrality through sampling
- Fully-dynamic approximation of betweenness centrality
- Relaxation-based coarsening for multilevel hypergraph partitioning
- Fast quasi-threshold editing
- Querying probabilistic neighborhoods in spatial data sets efficiently
- Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
- SNAP
- LAMG
- STXXL
- Paralution
- DISCO
- GraphBLAS
- KONECT
- Hyperbolic graph generator
- KADABRA
- NetLSD
- EdgeRewire
- Local community detection based on small cliques
- JGraphT—A Java Library for Graph Data Structures and Algorithms
- Optimizing node infiltrations in complex networks by a local search based heuristic
- Approximating Betweenness Centrality in Fully Dynamic Networks
- Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
- Maxent-stress optimization of 3D biomolecular models
- Parallel and I/O-efficient randomisation of massive networks using global curveball trades
This page was built for software: NetworKit
