Benchmarking for Graph Clustering and Partitioning-Reference-Cited by-同舟云学术

Benchmarking for Graph Clustering and Partitioning

Published:2014 Issue: Volume: Page:73-82
ISSN:
Container-title:Encyclopedia of Social Network Analysis and Mining
language:
Short-container-title:

Author:

Bader David A.,Meyerhenke Henning,Sanders Peter,Schulz Christian,Kappes Andrea,Wagner Dorothea

Publisher

Springer New York

Link

http://link.springer.com/content/pdf/10.1007/978-1-4614-6170-8_23

Reference29 articles.

1. Aloise D, Caporossi G, Perron S, Hansen P, Liberti L, Ruiz M (2012) Modularity maximization in networks by variable neighborhood search. In: 10th DIMACS implementation challenge workshop. Georgia Institute of Technology, Atlanta

2. Arenas A (2009) Network data sets. http://deim.urv.cat/aarenas/data/welcome.htm . Online; accessed 28 Sept 2012

3. Bader DA, Berry J, Kahan S, Murphy R, Jason Riedy E, Willcock J (2010) Graph 500 benchmark 1 (“search”), version 1.1. Technical report, Graph 500

4. Bader D, Meyerhenke H, Sanders P, Wagner D (2012) 10th DIMACS implementation challenge. http://www.cc.gatech.edu/dimacs10/ . Online; accessed 28 Sept 2012

5. Barabási A-L, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. O’Reach: Even Faster Reachability in Large Graphs;ACM Journal of Experimental Algorithmics;2022-10-21

2. Graph neural network inspired algorithm for unsupervised network community detection;Applied Network Science;2022-09-05

3. Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit;Lecture Notes in Computer Science;2022

4. Impact of AVX-512 Instructions on Graph Partitioning Problems.;50th International Conference on Parallel Processing Workshop;2021-08-09

5. External Labeling: Fundamental Concepts and Algorithmic Techniques;Synthesis Lectures on Visualization;2021-07-27