survey

A Critical Survey of the Multilevel Method in Complex Networks

Authors:

Vinícius Ferreira,

Maria Cristina Ferreira de Oliveira,

Alneu de Andrade LopesAuthors Info & Claims

ACM Computing Surveys (CSUR), Volume 53, Issue 2

Article No.: 39, Pages 1 - 35

https://doi.org/10.1145/3379347

Published: 17 April 2020 Publication History

Abstract

Multilevel optimization aims at reducing the cost of executing a target network-based algorithm by exploiting coarsened, i.e., reduced or simplified, versions of the network. There is a growing interest in multilevel algorithms in networked systems, mostly motivated by the urge for solutions capable of handling large-scale networks. Notwithstanding the success of multilevel optimization in a multitude of application problems, we were unable to find a representative survey of the state-of-the-art, or consistent descriptions of the method as a general theoretical framework independent of a specific application domain. In this article, we strive to fill this gap, presenting an extensive survey of the literature that contemplates a systematic overview of the state-of-the-art, a panorama of the historical evolution and current challenges, and a formal theoretical framework of the multilevel optimization method in complex networks. We believe our survey provides a useful resource to individuals interested in learning about multilevel strategies, as well as to those engaged in advancing theoretical and practical aspects of the method or in developing solutions in novel application domains.

References

[1]

J. Abello, F. V. Ham, and N. Krishnan. 2006. ASK-GraphView: A large scale graph visualization system. IEEE Transactions on Visualization and Computer Graphics 12, 5 (2006), 669--676.

Digital Library

[2]

A. Abou-Rjeili and G. Karypis. 2006. Multilevel algorithms for partitioning power-law graphs. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS’06). 124--124.

[3]

Yaroslav Akhremtsev, Peter Sanders, and Christian Schulz. 2015. (Semi-)External algorithms for graph partitioning and clustering. In Proceedings of the Meeting on Algorithm Engineering 8 Expermiments (ALENEX’15). 33--43.

Digital Library

[4]

D. Archambault, T. Munzner, and D. Auber. 2008. GrouseFlocks: Steerable exploration of graph hierarchy space. IEEE Transactions on Visualization and Computer Graphics 14, 4 (2008), 900--913.

Digital Library

[5]

A. Arenas, J. Duch, A. Fernández, and S. Gómez. 2007. Size reduction of complex networks preserving modularity. New Journal of Physics 9, 6 (2007), 176.

[6]

Alessio Arleo, Walter Didimo, Giuseppe Liotta, and Fabrizio Montecchiani. 2018. A distributed multilevel force-directed algorithm. In Graph Drawing and Network Visualization, Yifan Hu and Martin Nöllenburg (Eds.). Springer International Publishing, Cham, 3--17.

[7]

A. S. Asratian, T. M. J. Denley, and R. Häggkvist. 1998. Bipartite Graphs and Their Applications. Cambridge University Press, New York, NY.

[8]

László Babai. 1977. Some applications of graph contractions. Journal of Graph Theory 1, 2 (1977), 125--130.

[9]

Jie Bao, Yu Zheng, David Wilkie, and Mohamed Mokbel. 2015. Recommendations in location-based social networks: A survey. GeoInformatica 19, 3 (1 Jul 2015), 525--565.

Digital Library

[10]

S. T. Barnard. 1995. PMRSB: Parallel multilevel recursive spectral bisection. In Proceedings of the ACM/IEEE Conference on Supercomputing (CDROM’95). 1--27.

Digital Library

[11]

S. T. Barnard and H. D. Simon. 1994. Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency and Computation: Practice and Experience 6, 2 (1994), 101--117.

[12]

V. Batagelj, F. J. Brandenburg, W. Didimo, G. Liotta, P. Palladino, and M. Patrignani. 2011. Visual analysis of large graphs using (X,Y)-clustering and hybrid visualizations. IEEE Transactions on Visualization and Computer Graphics 17, 11 (2011), 1587--1598.

Digital Library

[13]

U. Benlic and J. K. Hao. 2011. A mltilevel memetic approach for improving graph k-partitions. IEEE Transactions on Evolutionary Computation 15, 5 (2011), 624--642.

Digital Library

[14]

V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 10008, 10 (2008), 6.

[15]

N. Bouhmala and X. Cai. 2001. Partition of unstructured finite element meshes by a multilevel approach. In Proceedings of the International Workshop on Applied Parallel Computing, Vol. 1947. 187--195.

[16]

A. Brandt. 1988. Multilevel computations: Review and recent developments. In Multigrid Methods: Theory, Applications, and Supercomputing, Proceedings of the 3rd Copper Mountain Conference on Multigrid Methods. Lecture Notes in Pure and Applied Mathematics, Vol. 110. 35--62.

[17]

J. Brannick, Y. Chen, J. Kraus, and L. Zikatanov. 2013. Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs. SIAM Journal on Numerical Analysis 51, 3 (2013), 1805--1827.

[18]

Enrique Burgos, Horacio Ceva, Laura Hernández, R. P. J. Perazzo, Mariano Devoto, and Diego Medan. 2008. Two classes of bipartite networks: Nested biological and social systems. Physical Review E 78, 4 (2008), 046113.

[19]

Haochen Chen, Bryan Perozzi, Yifan Hu, and Steven Skiena. 2018. HARP: Hierarchical representation learning for networks. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence.

[20]

J. Chen and I. Safro. 2011. Algebraic distance on graphs. SIAM Journal on Scientific Computing 33, 6 (2011), 3468--3490.

Digital Library

[21]

W. Cheng-gen, B. H. Zhang, P. Li, J. Shu, L. Y. Cheng, Z. G. Hao, and B. O. Zhi-qian. 2008. Power system islanding based on multilevel reduced graph partitioning algorithm. In Proceedings of the Universities Power Engineering Conference. 1--6.

[22]

M. Chernoskutov, Y. Ineichen, and C. Bekas. 2015. Heuristic algorithm for approximation betweenness centrality using graph coarsening. Procedia Computer Science 66 (2015), 83--92.

[23]

C. Chevalier and F. Pellegrini. 2006. Improvement of the efficiency of genetic algorithms for scalable parallel graph partitioning in a multi-level framework. In Proceedings of the European Conference on Parallel Processing (Euro-Par’06), Vol. 4128. 243--252.

[24]

C. Chevalier and I. Safro. 2009. Comparison of coarsening schemes for multilevel graph partitioning. In Proceedings of the International Conference on Learning and Intelligent Optimization (LION’09), Lecture Notes in Computer Science, Vol. 5851. 191--205.

[25]

D. Cintra, Alan Valejo, A. A. Lopes, and Maria C. F. Oliveira. 2019. Visualization to assist interpretation of the multilevel paradigm in bipartite graphs. In Proceedings of the 15th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications.

[26]

A. Clauset, M. E. J. Newman, and C. Moore. 2004. Finding community structure in very large networks. Physical Review E 70, 6 (2004), 066111.

[27]

J. Cong and M. Smith. 1993. A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design. In Proceedings of the ACM/IEEE Design Automation Conference. 755--760.

[28]

Thiago de Paulo Faleiros, Rafael Geraldeli Rossi, and Alneu de Andrade Lopes. 2017. Optimizing the class information divergence for transductive classification of texts using propagation in bipartite graphs. Pattern Recognition Letters 87 (2017), 127--138.

Digital Library

[29]

M. D. Dias, M. R. Mansour, F. Dias, F. Petronetto, C. T. Silva, and L. G. Nonato. 2017. A hierarchical network simplification via non-negative matrix factorization. In Proceedings of the Conference on Graphics, Patterns and Images (SIBGRAPI’17). 119--126.

[30]

D. E. Drake and S. Hougardy. 2003. Linear time local improvements for weighted matchings in graphs. In Experimental and Efficient Algorithms. 107--119.

[31]

D. E. Drake and S. Hougardy. 2003. A simple approximation algorithm for the weighted matching problem. Information Processing Letters 85, 4 (2003), 211--213.

Digital Library

[32]

R. Van Driessche and Dirk Roose. 1995. A Graph Contraction Algorithm for the Fast Calculation of the Fiedler Vector of a Graph. Technical Report. Society for Industrial and Applied Mathematics, Philadelphia, PA.

[33]

A. Ducournau, S. Rital, A. Bretto, and B. Laget. 2009. A multilevel spectral hypergraph partitioning approach for color image segmentation. In Proceedings of the IEEE International Conference on Signal and Image Processing Applications, Conference Proceedings (ICSIPA’09). 419--424.

[34]

D. Eppstein. 1992. Sparsification—A technique for speeding up dynamic graph algorithms. In Proceedings of the Annual Symposium on Foundations of Computer Science. 60--69.

Digital Library

[35]

K. Erciye, A. Alp, and G. Marshall. 2005. Serial and parallel multilevel graph partitioning using fixed centers. In Proceedings of the International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’05). 127--136.

[36]

H.-R. Fang, S. Sakellaridi, and Y. Saad. 2010. Multilevel manifold learning with application to spectral clustering. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM’10). 419.

[37]

T. Feder and R. Motwani. 1995. Clique partitions, graph compression and speeding-up algorithms. Journal of Computer and System Sciences 51, 2 (1995), 261--272.

Digital Library

[38]

V. Ferreira, Alan Valejo, and A. A. Lopes. 2019. A scalability approach based on multilevel optimization for link prediction methods. In Brazilian Conference on Intelligent Systems (BRACIS), Accepted Paper. 365--370.

[39]

C. M. Fiduccia and R. M. Mattheyses. 1982. A linear-time heuristic for improving network partitions. In Proceedings of the Design Automation Conference (DAC’82). Piscataway, NJ, 175--181.

[40]

Santo Fortunato. 2010. Community detection in graphs. Physics Reports 486, 3–5 (2010), 75--174.

[41]

Y. Frishman and A. Tal. 2007. Multi-level graph layout on the GPU. IEEE Transactions on Visualization and Computer Graphics 13, 6 (2007), 1310--1317.

Digital Library

[42]

Thomas M. J. Fruchterman and Edward M. Reingold. 1991. Graph drawing by force-directed placement. Software: Practice and Experience 21, 11 (1991), 1129--1164.

Digital Library

[43]

Harold N. Gabow, Zvi Galil, and Thomas H. Spencer. 1989. Efficient implementation of graph algorithms using contraction. Journal of the ACM (JACM) 36, 3 (1989), 540--572.

Digital Library

[44]

S. F. Galán and O. J. Mengshoel. 2018. Neighborhood beautification: Graph layout through message passing. Journal of Visual Languages 8 Computing 44 (2018), 72--88.

[45]

E. R. Gansner, Y. Hu, S. North, and C. Scheidegger. 2011. Multilevel agglomerative edge bundling for visualizing large graphs. In Proceedings of the IEEE Pacific Visualization Symposium (PacificVis’11). 187--194.

[46]

R. Glantz, H. Meyerhenke, and C. Schulz. 2014. Tree-based coarsening and partitioning of complex networks. In Proceedings of the International Symposium on Experimental Algorithms (SEA’14), Lecture Notes in Computer Science, Vol. 8504. 364--375.

[47]

Anshul Gupta. 1997. Fast and effective algorithms for graph partitioning and sparse-matrix ordering. IBM Journal of Research and Development 41, 1.2 (1997), 171--183.

Digital Library

[48]

S. Hachul and M. Jünger. 2005. Drawing large graphs with a potential-field-based multilevel algorithm. In Proceedings of the International Symposium on Graph Drawing (GD’05). 285--295.

[49]

B. Hendrickson and R. Leland. 1995. A multilevel algorithm for partitioning graphs. In Proceedings of the ACM/IEEE Conference on Supercomputing. 28.

[50]

Tobias Heuer and Sebastian Schlag. 2017. Improving coarsening schemes for hypergraph partitioning by exploiting community structure. In Proceedings of the International Symposium on Experimental Algorithms (SEA’17) (Leibniz International Proceedings in Informatics (LIPIcs)), Vol. 75. 21:1–21:19.

[51]

D. S. Hirschberg, A. K. Chandra, and D. V. Sarwate. 1979. Computing connected components on parallel computers. Communications of the ACM 22, 8 (1979), 461--464.

Digital Library

[52]

M. Holtgrewe, P. Sanders, and C. Schulz. 2010. Engineering a scalable high quality graph partitioner. In Proceedings of the IEEE International Symposium on Parallel Distributed Processing (IPDPS’10). 1--12.

[53]

Jianbin Huang, Heli Sun, Jiawei Han, Hongbo Deng, Yizhou Sun, and Yaguang Liu. 2010. SHRINK: A structural clustering algorithm for detecting hierarchical communities in networks. In Proceedings of the International Conference on Information and Knowledge Management. 219--228.

Digital Library

[54]

X. Huang, W. Lai, D. Zhang, M. Huang, and Q. V. Nguyen. 2007. A kernel-based algorithm for multilevel drawing Web graphs. In Proceedings of the Computer Graphics, Imaging and Visualisation (CGIV’07). 454--459.

[55]

C. Jian-bin, D. Xiang-jun, and S. Han-tao. 2004. The refinement algorithm consideration in text clustering scheme based on multilevel graph. Wuhan University Journal of Natural Sciences 9, 5 (2004), 671--675.

[56]

Y. Kang, X. Gu, W. Wang, and D. Meng. 2015. Scalable clustering algorithm via a triangle folding processing for complex networks. In Proceedings of the ACM International on Conference on Information and Knowledge Management (CIKM’15). 33--42.

[57]

Y. Kang, B. Yu, W. Wang, and D. Meng. 2015. Spectral clustering for large-scale social networks via a pre-coarsening sampling based Nystrom method. In Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD’15), Vol. 9078. 106--118.

[58]

David R. Karger and Clifford Stein. 1993. An Õ(n²) algorithm for minimum cuts. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC’93). ACM, New York, NY, 757--765.

[59]

G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. 1997. Multilevel hypergraph partitioning: Application in VLSI domain. In Proceedings of the ACM/IEEE Design Automation Conference, Vol. 7. 69--79.

[60]

G. Karypis and V. Kumar. 1995. Analysis of multilevel graph partitioning. In Proceedings of the ACM/IEEE Conference on Supercomputing. 1--19.

[61]

G. Karypis and V. Kumar. 1995. METIS—Unstructured Graph Partinioning and Sparse Matrix Ordering System. Technical Report. University of Minnesota, Department of Computer Science. 1--16.

[62]

G. Karypis and V. Kumar. 1996. Parallel multilevel graph partitioning. In Proceedings of International Conference on Parallel Processing. 314--319.

[63]

G. Karypis and V. Kumar. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20, 1 (1998), 359--392.

Digital Library

[64]

G. Karypis and V. Kumar. 1998. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Compuing 48, 1 (1998), 96--129.

Digital Library

[65]

G. Karypis and V. Kumar. 1999. Multilevel k-way hypergraph partitioning. In Proceedings of the ACM/IEEE Conference on Design Automation Conference (DAC’99). 343--348.

[66]

G. Karypis and V. Kumar. 1999. Parallel multilevel k-way partitioning scheme for irregular graphs. In Proceedings of the ACM/IEEE Conference on Supercomputing (CS’99), Vol. 41. 278--300.

[67]

John W. Kennedy and Manfred Gordon. 1979. Graph contractions and a generalized Möbius inversion. Annals of the New York Academy of Sciences 319, 1 (1979), 331--348.

[68]

B. W. Kernighan and S. Lin. 1970. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal 49, 2 (1970), 291--307.

[69]

M. R. Khokher, A. Ghafoor, and A. M. Siddiqui. 2012. Multilevel graph cuts based image segmentation. In Proceedings of the International Conference on Digital Image Computing Techniques and Applications (DICTA’12). 1--8.

[70]

B. Kitchenham, R. Pretorius, D. Budgen, O. P. Brereton, M. Turner, M. Niazi, and S. Linkman. 2010. Systematic literature reviews in software engineering—A tertiary study. Information and Software Technology 52, 8 (2010), 792--805.

Digital Library

[71]

P. Korošec, J. Šilc, and B. Robič. 2003. Mesh partitioning: A multilevel ant-colony-optimization algorithm. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS’03).

[72]

Jérôme Kunegis, Ernesto W. De Luca, and Sahin Albayrak. 2010. The link prediction problem in bipartite networks. In Computational Intelligence for Knowledge-Based Systems Design, Eyke Hüllermeier, Rudolf Kruse, and Frank Hoffmann (Eds.). Springer, Berlin, 380--389.

[73]

D. LaSalle and G. Karypis. 2013. Multi-threaded graph partitioning. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS’13). 225--236.

[74]

D. Lasalle and G. Karypis. 2015. Multi-threaded modularity based graph clustering using the multilevel paradigm. Journal of Parallel and Distributed Computing 76 (2015), 66--80.

Digital Library

[75]

Xin Liu, Weichu Liu, Tsuyoshi Murata, and Ken Wakita. 2014. A framework for community detection in heterogeneous multi-relational networks. Advances in Complex Systems 17, 6 (2014), 1450018.

[76]

Yike Liu, Tara Safavi, Abhilash Dighe, and Danai Koutra. 2018. Graph summarization methods and applications: A survey. ACM Computing Surveys (CSUR) 51, 3 (2018), 62.

Digital Library

[77]

H. Lombaert, Y. Sun, L. Grady, and C. Xu. 2005. A multilevel banded graph cuts method for fast image segmentation. In Proceedings of the International Conference on Computer Vision (ICCV’05).

[78]

L. Lü and T. Zhou. 2010. Link prediction in weighted networks: The role of weak ties. Europhysics Letters (EPL) 89, 1 (2010), 18001.

[79]

Linyuan Lu and Tao Zhou. 2011. Link prediction in complex networks: A survey. Physica A: Statistical Mechanics and its Applications 390, 6 (2011), 1150--1170.

[80]

J. Ma, S. Li, A. Hao, and H. Qin. 2013. Unsupervised co-segmentation of complex image set via bi-harmonic distance governed multi-level deformable graph clustering. In Proceedings of the IEEE International Symposium on Multimedia (ISM’13). 38--45.

[81]

Xiaoke Ma, Di Dong, and Quan Wang. 2018. Community detection in multi-layer networks using joint nonnegative matrix factorization. IEEE Transactions on Knowledge and Data Engineering 31, 2 (2018), 273--286.

Digital Library

[82]

N. Mansour and G. C. Fox. 1992. Allocating data to multicomputer nodes by physical optimization algorithms for loosely synchronous computations. Concurrency and Computation: Practice and Experience 4, 7 (Oct. 1992), 557--574.

[83]

N. Mansour, R. Ponnusamy, A. Choudhary, and G. C. Fox. 1993. Graph contraction for physical optimization methods: A quality-cost tradeoff for mapping data on parallel computers. In Proceedings of the International Conference on Supercomputing (ICS’93). New York, NY, 1--10.

[84]

G. Mao and N. Zhang. 2014. A multilevel simplification algorithm for computing the average shortest-path length of scale-free complex network. Journal of Applied Mathematics 2014 (2014).

[85]

David W. Matula, Yossi Shiloach, and Robert E. Tarjan. 1980. Two Linear-Time Algorithms for Five-Coloring a Planar Graph. Technical Report. Department of Computer Science, Stanford University, California.

[86]

J. Maue and P. Sanders. 2007. Engineering algorithms for approximate weighted matching. In Proceedings of the International Conference on Experimental Algorithms (WEA’07). Springer-Verlag, Berlin, 242--255.

[87]

H. Meyerhenke, M. Nollenburg, and C. Schulz. 2018. Drawing large graphs by multilevel maxent-stress optimization. IEEE Transactions on Visualization and Computer Graphics PP, 99 (2018), 1--1.

[88]

H. Meyerhenke, P. Sanders, and C. Schulz. 2014. Partitioning complex networks via size-constrained clustering. In Proceedings of the International Symposium on Experimental Algorithms, Volume 8504. Springer-Verlag, New York, 351--363.

[89]

Diego Minatel, Vinícius Ferreira, and Alneu Andrade Lopes. 2019. A multilevel approach for building location-based social network by using stay points. In 2019 8th Brazilian Conference on Intelligent Systems (BRACIS’19). IEEE, 359--364.

[90]

B. Monien, R. Preis, and R. Diekmann. 2000. Quality matching and local improvement for multilevel graph-partitioning. Parallel Computing 26, 12 (2000), 1609--1634.

Digital Library

[91]

A. Montanvert and P. Meer. 1990. Irregular tessellation based image analysis. In [1990] Proceedings of the 10th International Conference on Pattern Recognition, Vol. 1. IEEE, 474--479.

[92]

M. E. J. Newman. 2003. Mixing patterns in networks. Physical Review E 67, 2 (2003), 026126.

[93]

M. E. J. Newman. 2006. Modularity and community structure in networks. Proceedings of the National Academy of Sciences 103, 23 (2006), 8577--8582.

[94]

A. Noack and R. Rotta. 2009. Multi-level algorithms for modularity clustering. In Proceedings of the International Symposium on Experimental Algorithms (SEA’09), Lecture Notes in Computer Science, Vol. 5526. 257--268.

[95]

S. Oliveira and S. C. Seok. 2005. A multi-level approach for document clustering. In Proceedings of the International Conference on Computational Science (ICCS’05), Vol. 3514. 204--211.

[96]

S. Oliveira and S. C. Seok. 2006. A multilevel approach to identify functional modules in a yeast protein-protein interaction network. In Proceedings of the International Conference on Computational Science (ICCS’06). 726--733.

[97]

S. Oliveira and S. C. Seok. 2007. Multilevel approaches for large-scale proteomic networks. International Journal of Computer Mathematics 84, 5 (2007), 683--695.

Digital Library

[98]

S. Oliveira and S. C. Seok. 2007. Triangular clique based multilevel approaches to identify protein functional modules. In Proceedings of the High Performance Computing for Computational Science (VECPAR’07), Michel Daydé, José M. L. M. Palma, Álvaro L. G. A. Coutinho, Esther Pacitti, and João Correia Lopes (Eds.). Springer, Berlin, 556--565.

[99]

S. Oliveira and S.-C. Seok. 2008. A matrix-based multilevel approach to identify functional protein modules. International Journal of Bioinformatics Research and Applications 4, 1 (2008), 11--27.

Digital Library

[100]

B. On and D. Lee. 2007. Scalable name disambiguation using multi-level graph partition. In Proceedings of the SIAM International Conference on Data Mining (SDM’07). 575--580.

[101]

D. Osei-Kuffuor, R. Li, and Y. Saad. 2015. Matrix reordering using multilevel graph coarsening for ILU preconditioning. SIAM Journal on Scientific Computing 37, 1 (2015), A391–A419.

[102]

F. Pellegrini and J. Roman. 1996. SCOTCH: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking (HPCN Europe 1996). 493--498.

[103]

Alexandre Perrot and David Auber. 2018. Cornac: Tackling huge graph visualization with big data infrastructure. IEEE Transactions on Big Data 14 (2018), 80--92.

[104]

K. Petersen, R. Feldt, S. Mujtaba, and M. Mattsson. 2008. Systematic mapping studies in software engineering. In Proceedings of the 12th International Conference on Evaluation and Assessment in Software Engineering 17 (2008), 10.

[105]

Phu Pham and Phuc Do. 2019. W-MetaPath2Vec: The topic-driven meta-path-based model for large-scaled content-based heterogeneous information network representation learning. Expert Systems with Applications 123 (2019), 328--344.

Digital Library

[106]

Cynthia A Phillips. 1989. Parallel Graph Contraction. Technical Report. Microsystems Research Center, Massachusetts Institute of Technology, Cambridge, MA.

[107]

R. Ponnusamy, N. Mansour, A. Choudhary, and G. C. Fox. 1994. Graph contraction for mapping data on parallel computers: A quality-cost tradeoff. Scientific Programming 3 (1994), 73--82.

Digital Library

[108]

M. Purohit, B. A. Prakash, C. Kang, Y. Zhang, and V. S. Subrahmanian. 2014. Fast influence-based coarsening for large networks. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’14). 1296--1305.

[109]

U. N. Raghavan, R. Albert, and S. Kumara. 2007. Near linear time algorithm to detect community structures in large-scale networks. Physical Review E 76, 3 (Sept. 2007), 036106.

[110]

D. Ron, I. Safro, and A. Brandt. 2011. Relaxation-based coarsening and multiscale graph organization. Multiscale Modeling 8 Simulation 9, 1 (2011), 407--423.

[111]

Azriel Rosenfeld. 1986. Partial path groups and parallel graph contractions. The Book of L. Springer, 369--382.

[112]

Rafael Geraldeli Rossi, Alneu de Andrade Lopes, Thiago de Paulo Faleiros, and Solange Oliveira Rezende. 2014. Inductive model generation for text classification using a bipartite heterogeneous network. Journal of Computer Science and Technology 29, 3 (2014), 361--375.

[113]

I. Safro, D. Ron, and A. Brandt. 2006. Graph minimum linear arrangement by multilevel weighted edge contractions. Journal of Algorithms 60, 1 (2006), 24--41.

Digital Library

[114]

I. Safro, P. Sanders, and C. Schulz. 2012. Advanced coarsening schemes for graph partitioning. In Proceedings of the International Symposium on Experimental Algorithms (SEA’12), Lecture Notes in Computer Science, Vol. 7276. 369--380.

[115]

S. Sakellaridi, H. R. Fang, and Y. Saad. 2008. Graph-based multilevel dimensionality reduction with applications to eigenfaces and latent semantic indexing. In Proceedings of the International Conference on Machine Learning and Applications (ICMLA’08). 194--200.

[116]

P. Sanders and C. Schulz. 2011. Engineering multilevel graph partitioning algorithms. In Proceedings of the European Symposium on Algorithms (ESA’11), Lecture Notes in Computer Science, Vol. 6942. 469--480.

[117]

P. Schuetz and A. Caflisch. 2008. Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. Physical Review E 77, 4 (2008), 1--7.

[118]

P. Schuetz and A. Caflisch. 2008. Multistep greedy algorithm identifies community structure in real-world and computer-generated networks. Physical Review E 78, 2 (2008), 026112.

[119]

C. Shi, Y. Li, J. Zhang, Y. Sun, and P. S. Yu. 2017. A survey of heterogeneous information network analysis. IEEE Transactions on Knowledge and Data Engineering 29, 1 (2017), 17--37.

Digital Library

[120]

A. M. Siddiqui, A. Ghafoor, and M. R. Khokher. 2013. Image segmentation using multilevel graph cuts and graph development using fuzzy rule-based system. IET Image Processing 7, 3 (2013), 201--211.

[121]

P. R. Suaris and G. Kedem. 1988. An algorithm for quadrisection and its application to standard cell placement. IEEE Transactions on Circuits and Systems 35, 3 (1988), 294--303.

[122]

S.-H. Teng. 1999. Coarsening, sampling, and smoothing: Elements of the multilevel method. Algorithms for Parallel Processing 105 (1999), 247--276.

[123]

D. Tolliver, R. T. Collins, and S. Baker. 2007. Multilevel spectral partitioning for efficient image segmentation and tracking. In Proceedings of the IEEE Workshop on Applications of Computer Vision (WACV’07). 414--420.

[124]

S. Ubaru and Y. Saad. 2017. Sampling and multilevel coarsening algorithms for fast matrix approximations. Numerical Linear Algebra with Applications 26, 3 (2017), e2234.

[125]

Alan Valejo, Brett Drury, Jorge Valverde-Rebaza, and Alneu de Andrade Lopes. 2014. Identification of related Brazilian Portuguese verb groups using overlapping community detection. In Proceedings of the International Conference on the Computational Processing of Portuguese (PROPOR’14). 292--297.

[126]

A. Valejo, G. P. Rocha Filho, M. C. F. Oliveira, and A. A. Lopes. 2018. Multilevel approach for combinatorial optimization in bipartite network. Knowledge-Based Systems (KNOSYS).

[127]

A. Valejo, V. Ferreira, M. C. F. Oliveira, and A. A. Lopes. 2018. Community detection in bipartite network: A modified coarsening approach. In Proceedings of the International Symposium on Information Management and Big Data (SIMBig’18), Extended Version.

[128]

A. Valejo, V. Ferreira, G. P. Rocha Filho, M. C. F. Oliveira, and A. A. Lopes. 2017. One-mode projection-based multilevel approach for community detection in bipartite networks. In Proceedings of the International Symposium on Information Management and Big Data (SIMBig’17).

[129]

A. Valejo, J. Valverde-Rebaza, B. Drury, and A. A. Lopes. 2014. Multilevel refinement based on neighborhood similarity. In Proceedings of the International Database Engineering 8 Applications Symposium. 67--76.

[130]

A. Valejo, J. Valverde-Rebaza, and A. A. Lopes. 2014. A multilevel approach for overlapping community detection. In Proceedings of the Brazilian Conference on Intelligent Systems. 390--395.

[131]

J. Valverde-Rebaza, Alan Valejo, L. Berton, T. Faleiros, and A. Lopes. 2015. A naive Bayes model based on overlapping groups for link prediction in online social networks. In Proceedings of the ACM Symposium on Applied Computing (SAC’15). 1136--1141.

[132]

C. Walshaw. 2001. A multilevel algorithm for force-directed graph drawing. In Proceedings of the International Symposium on Graph Drawing, Vol. 1984. 171--182.

[133]

C. Walshaw. 2001. A Multilevel Approach to the Graph Colouring Problem. Technical Report. Computing and Mathematical Sciences, University of Greenwich.

[134]

C. Walshaw. 2001. A Multilevel Lin-Kernighan-Helsgaun Algorithm for the Travelling Salesman Problem. Technical Report. Computing and Mathematical Sciences, University of Greenwich.

[135]

C. Walshaw. 2004. Multilevel refinement for combinatorial optimisation problems. Annals of Operations Research 131, 1-4 (2004), 325--372.

[136]

C. Walshaw. 2008. Multilevel refinement for combinatorial optimisation: Boosting metaheuristic performance. Hybrid Metaheuristics 114 (2008), 261--289.

[137]

C. Walshaw and M. Cross. 1998. Mesh Partitioning: A multilevel balancing and refinement algorithm. SIAM Journal on Scientific Computing (SISC) 22, 1 (1998), 63--80.

Digital Library

[138]

C. Walshaw and M. Cross. 2000. Mesh partitioning: A multilevel balancing and refinement algorithm. Journal on Scientific Computing (SIAM) 22, 1 (2000), 63--80.

Digital Library

[139]

C. Walshaw and M. Cross. 2000. Parallel optimisation algorithms for multilevel mesh partitioning. Parallel Computing 26, i (2000), 1635--1660.

Digital Library

[140]

C. Walshaw and M Cross. 2007. JOSTLE: Parallel Multilevel Graph-partitioning Software—An Overview. Technical Report. Computing and Mathematical Sciences, University of Greenwich. 27--58.

[141]

C. Walshaw and M. G. Everett. 2002. Multilevel Landscapes in Combinatorial Optimisation. Technical Report. Computing and Mathematical Sciences, University of Greenwich. 1--21.

[142]

F. Wang and C. Zhang. 2007. Fast multilevel transduction on graphs. In Proceedings of the SIAM Conference on Data Mining. 157--168.

[143]

Lu Wang, Yanghua Xiao, Bin Shao, and Haixun Wang. 2014. How to partition a billion-node graph. In Proceedings of the International Conference on Data Engineering. 568--579.

[144]

D. J. Watts and S. H. Strogatz. 1998. Collective dynamics of ‘small-world’ networks. Nature 393, 6684 (1998), 440--442.

[145]

P. C. Wong, P. Mackey, K. A. Cook, R. M. Rohrer, H. Foote, and M. A. Whiting. 2009. A multi-level middle-out cross-zooming approach for large graph analytics. In Proceedings of the 2009 IEEE Symposium on Visual Analytics Science and Technology. 147--154.

[146]

L. Yao, Z. Wang, Z. Li, W. Cao, and Y. Wang. 2011. A novel coarsening scheme for multilevel graph partitiong. In Proceedings of the International Conference on Biomedical Engineering and Informatics (BMEI’11). 2091--2094.

[147]

Z. Ye, S. Hu, and J. Yu. 2008. Adaptive clustering algorithm for community detection in complex networks. Physical Review E 78, 4 (2008), 046115.

[148]

Massimiliano Zanin, David Papo, Pedro A Sousa, Ernestina Menasalvas, Andrea Nicchi, Elaine Kubik, and Stefano Boccaletti. 2016. Combining complex networks and data mining: Why and how. Physics Reports 635 (2016), 1--44.

[149]

An Zeng, Zhesi Shen, Jianlin Zhou, Jinshan Wu, Ying Fan, Yougui Wang, and H. Eugene Stanley. 2017. The science of science: From the perspective of complex systems. Physics Reports 714 (2017), 1--73.

[150]

C. Zhang and F. Wang. 2010. A multilevel approach for learning from labeled and unlabeled data on graphs. Pattern Recognition 43, 6 (2010), 2301--2314.

Digital Library

[151]

W. Zhou and J. Huang. 2008. A fast multi-level algorithm for drawing large undirected graphs. In Proceedings of the International Conference on Internet Computing in Science and Engineering (ICICSE’08). 110--117.

[152]

M. Zhu, F. Meng, Y. Zhou, and G. Yuan. 2012. An approximate spectral clustering for community detection based on coarsening networks. International Journal of Advancements in Computing Technology 4, 4 (2012), 235--243.

Cited By

Valejo AAlthoff PFaleiros TFilho GZhu YYan JLiu WZhao L(2024)Coarsening Algorithm Based on Multi-Label Propagation for Knowledge Discovery in Bipartite NetworksIEEE Transactions on Network Science and Engineering10.1109/TNSE.2023.333165511:2(1799-1809)Online publication date: Mar-2024
https://doi.org/10.1109/TNSE.2023.3331655
Zhao HZhang XWang YDiao ZLi YXie G(2023)Improving the Scalability of Distributed Network Emulations: An Algorithmic PerspectiveIEEE Transactions on Network and Service Management10.1109/TNSM.2023.328703020:4(4325-4339)Online publication date: Dec-2023
https://doi.org/10.1109/TNSM.2023.3287030
Zheng YJia CLi X(2023)A multi-level generative framework for community detection in attributed networksJournal of Complex Networks10.1093/comnet/cnad02011:3Online publication date: 7-Jun-2023
https://doi.org/10.1093/comnet/cnad020
Show More Cited By

Index Terms

A Critical Survey of the Multilevel Method in Complex Networks

Recommendations

Community Detection in Complex Networks using Randomisation
ICONIAAC '14: Proceedings of the 2014 International Conference on Interdisciplinary Advances in Applied Computing

Community or modularity structures of a network are of interest as networks can have properties at the community level that are quite different from their properties at the level of the entire network. Thus the problem can be stated as one for natural ...
Rich-Club Connectivity in Large-Scale Complex Networks
CGC '12: Proceedings of the 2012 Second International Conference on Cloud and Green Computing

In the real-world network, i.e., Internet, the nodes with high degrees are found closely connected with each other, which is stated as the rich-club connectivity. Obtaining the rich club connectivity is an easy job for small graphs. However, with the ...
Adjusting assortativity in complex networks
ACM SE '14: Proceedings of the 2014 ACM Southeast Regional Conference

Assortativity has been widely studied for understanding the structure and function of complex networks. Assortative is defined as an association of items with other items having similar characteristics. The research has shown that assortativity has a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Computing Surveys

ACM Computing Surveys Volume 53, Issue 2

March 2021

848 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/3388460

Editor:
Albert Zomaya
University of Sydney, Australia

Issue’s Table of Contents

Copyright © 2020 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 April 2020

Accepted: 01 January 2020

Revised: 01 November 2019

Received: 01 May 2019

Published in CSUR Volume 53, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Survey
Research
Refereed

Funding Sources

Brazilian Federal Research Council (CNPq)
State of São Paulo Research Foundation (FAPESP)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - Brasil (CAPES)

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
679
Total Downloads

Downloads (Last 12 months)51
Downloads (Last 6 weeks)7

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

Valejo AAlthoff PFaleiros TFilho GZhu YYan JLiu WZhao L(2024)Coarsening Algorithm Based on Multi-Label Propagation for Knowledge Discovery in Bipartite NetworksIEEE Transactions on Network Science and Engineering10.1109/TNSE.2023.333165511:2(1799-1809)Online publication date: Mar-2024
https://doi.org/10.1109/TNSE.2023.3331655
Zhao HZhang XWang YDiao ZLi YXie G(2023)Improving the Scalability of Distributed Network Emulations: An Algorithmic PerspectiveIEEE Transactions on Network and Service Management10.1109/TNSM.2023.328703020:4(4325-4339)Online publication date: Dec-2023
https://doi.org/10.1109/TNSM.2023.3287030
Zheng YJia CLi X(2023)A multi-level generative framework for community detection in attributed networksJournal of Complex Networks10.1093/comnet/cnad02011:3Online publication date: 7-Jun-2023
https://doi.org/10.1093/comnet/cnad020
dos Santos NMinatel DValejo Ade A. Lopes A(2023)Bipartite Graph Coarsening for Text Classification Using Graph Neural NetworksProgress in Pattern Recognition, Image Analysis, Computer Vision, and Applications10.1007/978-3-031-49018-7_42(589-604)Online publication date: 27-Nov-2023
https://doi.org/10.1007/978-3-031-49018-7_42
Jatschka TRodemann TRaidl G(2023)A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location PlanningEvolutionary Computation in Combinatorial Optimization10.1007/978-3-031-30035-6_4(50-65)Online publication date: 12-Apr-2023
https://dl.acm.org/doi/10.1007/978-3-031-30035-6_4
Valejo AFabbri Rde Andrade Lopes AZhao Lde Oliveira M(2022)Multilevel Coarsening for Interactive Visualization of Large Bipartite NetworksFrontiers in Research Metrics and Analytics10.3389/frma.2022.8551657Online publication date: 16-Jun-2022
https://doi.org/10.3389/frma.2022.855165
Ayall TLiu HZhou CSeid AGereme FAbishu HYacob Y(2022)Graph Computing Systems and Partitioning Techniques: A SurveyIEEE Access10.1109/ACCESS.2022.321942210(118523-118550)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3219422
Lombardi FOnofri E(2022)Graph Contraction on Attribute-Based ColoringProcedia Computer Science10.1016/j.procs.2022.03.056201:C(429-436)Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1016/j.procs.2022.03.056
Valejo Ade Oliveira dos Santos WNaldi MZhao L(2021)A review and comparative analysis of coarsening algorithms on bipartite networksThe European Physical Journal Special Topics10.1140/epjs/s11734-021-00159-0230:14-15(2801-2811)Online publication date: 7-Jun-2021
https://doi.org/10.1140/epjs/s11734-021-00159-0
Carnevali JGeraldeli Rossi RMilios Ede Andrade Lopes A(2021)A graph-based approach for positive and unlabeled learningInformation Sciences: an International Journal10.1016/j.ins.2021.08.099580:C(655-672)Online publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1016/j.ins.2021.08.099
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Media

Figures

Other

Tables

View Issue’s Table of Contents