Fetching the paper…
Reading the bibliography…
Processing large complex networks like social networks or web graphs has recently attracted considerable interest.
R. V. Southwell, “Stress-Calculation in Frameworks by the Method of “Systematic Relaxation of Constraints”,” Proc. of the Royal Society of London , vol. 151, no. 872, pp. 56–95, 1935
1935
Earlier work this paper cites.
L. Hyafil and R. Rivest, “Graph Partitioning and Constructing Optimal Decision Trees are Polynomial Complete Problems,” IRIA – Laboratoire de Recherche en Informatique et Automatique, Tech. Rep. 33, 1973
1973
Earlier work this paper cites.
M. R. Garey, D. S. Johnson, and L. Stockmeyer, “Some Simplified NP-Complete Problems,” in Proceedings of the 6th ACM Symposium on Theory of Computing , ser. STOC ’74. ACM, 1974, pp. 47–63
1974
Earlier work this paper cites.
T. N. Bui and C. Jones, “Finding Good Approximate Vertex and Edge Partitions is NP-Hard,” IPL , vol. 42, no. 3, pp. 153–159, 1992
1992
Earlier work this paper cites.
G. Karypis and V. Kumar, “Parallel Multilevel k k -way Partitioning Scheme for Irregular Graphs,” in Proceedings of the ACM/IEEE Conference on Supercomputing’96 , 1996
1996
Earlier work this paper cites.
S. Brin and L. Page, “The Anatomy of a Large-Scale Hypertextual Web Search Engine,” Computer Networks , vol. 30, no. 1-7, pp. 107–117, 1998
1998
Earlier work this paper cites.
G. Karypis and V. Kumar, “A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs,” SIAM Journal on Scientific Computing , vol. 20, no. 1, pp. 359–392, 1998
1998
Earlier work this paper cites.
B. Hendrickson and T. G. Kolda, “Graph Partitioning Models for Parallel Computing,” Parallel Computing , vol. 26, no. 12, pp. 1519–1534, 2000
2000
Earlier work this paper cites.
B. Monien, R. Preis, and R. Diekmann, “Quality Matching and Local Improvement for Multilevel Graph-Partitioning,” Parallel Computing , vol. 26, no. 12, pp. 1609–1634, 2000
2000
Earlier work this paper cites.
C. Walshaw and M. Cross, “Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm,” SIAM Journal on Scientific Computing , vol. 22, no. 1, pp. 63–80, 2000
2000
Earlier work this paper cites.
K. Schloegel, G. Karypis, and V. Kumar, “Graph Partitioning for High Performance Scientific Simulations,” in The Sourcebook of Parallel Computing , 2003, pp. 491–541
2003
Earlier work this paper cites.
A. J. Soper, C. Walshaw, and M. Cross, “A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning,” Journal of Global Optimization , vol. 29, no. 2, pp. 225–241, 2004
2004
Earlier work this paper cites.
C. Walshaw, “Multilevel Refinement for Combinatorial Optimisation Problems,” Annals of OR , vol. 131, no. 1, pp. 325–372, 2004
2004
Earlier work this paper cites.
P. Boldi and S. Vigna, “The WebGraph framework I: Compression techniques,” in Proc. of the 13th Int. World Wide Web Conference (WWW 2004) . Manhattan, USA: ACM Press, 2004, pp. 595–601
2004
Cited alongside, same era.
A. Abou-Rjeili and G. Karypis, “Multilevel Algorithms for Partitioning Power-Law Graphs,” in Proc. of 20th IPDPS , 2006
2006
Cited alongside, same era.
H. Meyerhenke, B. Monien, and S. Schamberger, “Accelerating Shape Optimizing Load Balancing for Parallel FEM Simulations by Algebraic Multigrid,” in Proc. of 20th IPDPS , 2006
2006
Cited alongside, same era.
C. Walshaw and M. Cross, “JOSTLE: Parallel Multilevel Graph-Partitioning Software – An Overview,” in Mesh Partitioning Techniques and Domain Decomposition Techniques , 2007, pp. 27–58
2007
Cited alongside, same era.
U. N. Raghavan, R. Albert, and S. Kumara, “Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks,” Physical Review E , vol. 76, no. 3, 2007
D. Bader, H. Meyerhenke, P. Sanders, and D. Wagner, Eds., Proc. of the 10th DIMACS Impl. Challenge , ser. Cont. Mathematics. AMS, 2012
2012
Later among the works it cites.
Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola, and J. M. Hellerstein, “Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud,” Proc. VLDB Endow. , vol. 5, no. 8, pp. 716–727, Apr. 2012
2012
Later among the works it cites.
H. Meyerhenke, “Shape optimizing load balancing for mpi-parallel adaptive numerical simulations,” in Proc. of the 10th DIMACS Implementation Challenge – Graph Partitioning and Graph Clustering , ser. Cont. Mathematics. AMS, 2013
2013
Later among the works it cites.
Y. Tian, A. Balmin, S. A. Corsten, S. Tatikonda, and J. McPherson, “From" think like a vertex" to" think like a graph,” Proc. of the VLDB Endowment , vol. 7, no. 3, 2013
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2007
Cited alongside, same era.
C. Chevalier and F. Pellegrini, “PT-Scotch,” Parallel Computing , vol. 34, no. 6-8, pp. 318–331, 2008
2008
Cited alongside, same era.
C. Chevalier and I. Safro, “Comparison of Coarsening Schemes for Multilevel Graph Partitioning,” in Proceedings of the 3rd International Conference on Learning and Intelligent Optimization , ser. LNCS, vol. 5851, 2009, pp. 191–205
2009
Cited alongside, same era.
M. Holtgrewe, P. Sanders, and C. Schulz, “Engineering a Scalable High Quality Graph Partitioner,” Proc. of the 24th Int. Parallal and Distributed Processing Symposium , pp. 1–12, 2010
2010
Cited alongside, same era.
G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski, “Pregel: a system for large-scale graph processing,” in Proc. of Int. Conf. on Management of Data , ser. SIGMOD’10. ACM, 2010, pp. 135–146
2010
Cited alongside, same era.
C. Bichot and P. Siarry, Eds., Graph Partitioning . Wiley, 2011
2011
Cited alongside, same era.
P. Sanders and C. Schulz, “Engineering Multilevel Graph Partitioning Algorithms,” in Proc. of the 19th European Symp. on Algorithms , ser. LNCS, vol. 6942. Springer, 2011, pp. 469–480
2011
Cited alongside, same era.
P. Sanders and C. Schulz, “Distributed Evolutionary Graph Partitioning,” in Proc. of the 12th Workshop on Algorithm Engineering and Experimentation (ALENEX’12) , 2012, pp. 16–29
2012
Cited alongside, same era.
J. Ugander and L. Backstrom, “Balanced Label Propagation for Partitioning Massive Graphs,” in 6’th Int. Conf. on Web Search and Data Mining (WSDM’13) . ACM, 2013, pp. 507–516
2013
Later among the works it cites.
F. Rahimian, A. H. Payberah, S. Girdzijauskas, M. Jelasity, and S. Haridi, “JA-BE-JA: A Distributed Algorithm for Balanced Graph Partitioning,” in 7th International Conference on Self-Adaptive and Self-Organizing Systems . IEEE, 2013, pp. 51–60
2013
Later among the works it cites.
S. Kirmani and P. Raghavan, “Scalable Parallel Graph Partitioning,” in International Conference for High Performance Computing, Networking, Storage and Analysis (SC’13) . ACM, 2013, p. 51
2013
Later among the works it cites.
——, “Think Locally, Act Globally: Highly Balanced Graph Partitioning,” in Proc. of the 12th Int. Symp. on Experimental Algorithms (SEA’13) , ser. LNCS. Springer, 2013
2013
Later among the works it cites.
S. Salihoglu and J. Widom, “GPS: A Graph Processing System,” in Proce. of the 25th Int. Conf. on Scientific and Statistical Database Management , ser. SSDBM. ACM, 2013, pp. 22:1–22:12
2013
Later among the works it cites.
M. Ovelgönne and A. Geyer-Schulz, “An Ensemble Learning Strategy for Graph Clustering,” in Graph Partitioning and Graph Clustering - 10th DIMACS Implementation Challenge Workshop , ser. Contemporary Mathematics, vol. 588, 2013, pp. 187–206. [Online]. Available: http://www.ams.org/books/conm/588/11701
2013
Later among the works it cites.
H. Meyerhenke, P. Sanders, and C. Schulz, “Partitioning Complex Networks via Size-constrained Clustering,” in Proc. of the 13th Int. Symp. on Experimental Algorithms , ser. LNCS. Springer, 2014
2014
Closest in time.