NetworKit
From MaRDI portal
Software:51640
swMATH35938MaRDI QIDQ51640FDOQ51640
Author name not available (Why is that?)
Source code repository: https://github.com/networkit/networkit
Cited In (14)
- Engineering a combinatorial Laplacian solver: lessons learned
- Fast approximation of betweenness centrality through sampling
- Title not available (Why is that?)
- Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
- Title not available (Why is that?)
- Local community detection based on small cliques
- Fully-Dynamic Approximation of Betweenness Centrality
- JGraphT—A Java Library for Graph Data Structures and Algorithms
- Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently
- Optimizing node infiltrations in complex networks by a local search based heuristic
- Fast Quasi-Threshold Editing
- Approximating Betweenness Centrality in Fully Dynamic Networks
- Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
- Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning
This page was built for software: NetworKit
