ANF
From MaRDI portal
Software:24207
swMATH12276MaRDI QIDQ24207FDOQ24207
Author name not available (Why is that?)
Cited In (12)
- Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
- Kronecker graphs: an approach to modeling networks
- A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs
- FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
- The price of validity in dynamic networks
- Computing the eccentricity distribution of large graphs
- Information theory perspective on network robustness
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- When distributed computation is communication expensive
- Measuring the impact of MVC attack in large complex networks
- On computing the diameter of real-world undirected graphs
- I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs
This page was built for software: ANF
