The following pages link to NetworKit (Q51640):
Displaying 14 items.
- Local community detection based on small cliques (Q1657050) (← links)
- Engineering a combinatorial Laplacian solver: lessons learned (Q1736844) (← links)
- Fast approximation of betweenness centrality through sampling (Q1741154) (← links)
- Optimizing node infiltrations in complex networks by a local search based heuristic (Q2273672) (← links)
- Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently (Q2819527) (← links)
- Fully-Dynamic Approximation of Betweenness Centrality (Q3452779) (← links)
- Fast Quasi-Threshold Editing (Q3452790) (← links)
- Parallel and I/O-efficient randomisation of massive networks using global curveball trades (Q5009568) (← links)
- Scalable Katz Ranking Computation in Large Static and Dynamic Graphs (Q5009604) (← links)
- Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. (Q5075758) (← links)
- (Q5111761) (← links)
- JGraphT—A Java Library for Graph Data Structures and Algorithms (Q5132324) (← links)
- Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning (Q5197618) (← links)
- Approximating Betweenness Centrality in Fully Dynamic Networks (Q5856439) (← links)