Fast, exact graph diameter computation with vertex programming
暂无分享,去创建一个
[1] Bojan Mohar,et al. Eigenvalues, diameter, and mean distance in graphs , 1991, Graphs Comb..
[2] Andrew Lumsdaine,et al. Single-Source Shortest Paths with the Parallel Boost Graph Library , 2006, The Shortest Path Problem.
[3] Marco Rosa,et al. HyperANF: approximating the neighbourhood function of very large graphs on a budget , 2010, WWW.
[4] Joseph Gonzalez,et al. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs , 2012, OSDI.
[5] William G. Poole,et al. An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .
[6] Olga Kurasova,et al. Parallel Bidirectional Dijkstra's Shortest Path Algorithm , 2010, DB&IS.
[7] Ana Paula Appel,et al. HADI: Mining Radii of Large Graphs , 2011, TKDD.
[8] Ulrik Brandes,et al. Network Analysis: Methodological Foundations , 2010 .
[9] Robert E. Tarjan,et al. Better Approximation Algorithms for the Graph Diameter , 2014, SODA.
[10] Béla Bollobás,et al. The Diameter of a Scale-Free Random Graph , 2004, Comb..
[11] Chris Arney. Network Analysis: Methodological Foundations , 2012 .
[12] Anthony H. Dekker,et al. Network Robustness and Graph Topology , 2004, ACSC.
[13] Christos Faloutsos,et al. ANF: a fast and scalable tool for data mining in massive graphs , 2002, KDD.
[14] David A. Bader,et al. Parallel Shortest Path Algorithms for Solving Large-Scale Instances , 2006, The Shortest Path Problem.
[15] E. Cuthill,et al. Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.
[16] Ulrik Brandes,et al. Network Analysis: Methodological Foundations (Lecture Notes in Computer Science) , 2005 .