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