{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T02:17:23Z","timestamp":1777342643588,"version":"3.51.4"},"reference-count":194,"publisher":"Springer Science and Business Media LLC","issue":"30","license":[{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s11042-022-13017-5","type":"journal-article","created":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T09:04:58Z","timestamp":1653296698000},"page":"43315-43356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Graph partitioning and visualization in graph mining: a survey"],"prefix":"10.1007","volume":"81","author":[{"given":"Swati A.","family":"Bhavsar","sequence":"first","affiliation":[]},{"given":"Varsha H.","family":"Patil","sequence":"additional","affiliation":[]},{"given":"Aboli H.","family":"Patil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,23]]},"reference":[{"issue":"5","key":"13017_CR1","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1109\/TVCG.2006.120","volume":"12","author":"J Abello","year":"2006","unstructured":"Abello J, van Ham F, Krishnan N (2006) Ask-graph view: a large scale graph visualization system. IEEE Trans Visualization and Comput Graph 12(5):669\u2013676","journal-title":"IEEE Trans Visualization and Comput Graph"},{"key":"13017_CR2","doi-asserted-by":"crossref","unstructured":"Abnar A, Takaffoli M, Rabbany R, Zaiane OR (2014) SSRM: structural social role mining for dynamic social networks advances in social networks analysis and mining (ASONAM). IEEE\/ACM international conference 289-296","DOI":"10.1109\/ASONAM.2014.6921599"},{"key":"13017_CR3","unstructured":"Allegrograph. (n.d.) http:\/\/www.franz.com\/agraph\/allegrograph\/"},{"key":"13017_CR4","doi-asserted-by":"crossref","unstructured":"Alwahaishi S, Martinovic J, Snasel V, Kudelka M (2011) Analysis of the DBLP Publication Classification Using Concept Lattices. ISBN: 978\u201380\u2013248-2391. 132\u2013139","DOI":"10.1007\/978-3-642-22603-8_10"},{"issue":"6","key":"13017_CR5","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s00224-006-1350-7","volume":"39","author":"K Andreev","year":"2006","unstructured":"Andreev K, Racke H (2006) Balanced graph partitioning. Theory Computation System 39(6):929\u2013939","journal-title":"Theory Computation System"},{"key":"13017_CR6","doi-asserted-by":"crossref","unstructured":"Auber D, Chiricota Y, Jourdan F, Melancon G (2003) Multiscale visualization of Small world networks. Proc IEEE Ninth Conf Information Visualization (InfoVis):75\u201378","DOI":"10.1109\/INFVIS.2003.1249011"},{"key":"13017_CR7","unstructured":"AUTHOR (n.d.) http:\/\/www.hypergraphdb.org\/"},{"key":"13017_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1186\/s13637-015-0025-6","volume":"2015","author":"M Ayati","year":"2015","unstructured":"Ayati M, Erten S, Mark Chance R, Koyutrk M (2015) MOBAS: identification of disease-associated protein sub networks using modularity-based scoring. EURASIP J Bioinf Systems Bio 2015:7","journal-title":"EURASIP J Bioinf Systems Bio"},{"issue":"1\u20133","key":"13017_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal N, Blum A, Chawla S (2004) Correlation clustering. Mach Learn 56(1\u20133):89\u2013113","journal-title":"Mach Learn"},{"key":"13017_CR10","unstructured":"Bapodra M (2009) Chemical Reaction Rate Analysis using Graph Transformations. CO3120 Computer Science Project, Final Report, submitted to the University of Leicester in Partial Fulfillment for the degree of Bachelor of Science, Department of Computer science, University of Leicester 1\u201389"},{"key":"13017_CR11","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barabasi","year":"1999","unstructured":"Barabasi AL, Albert R (1999) Emergence of scaling in random networks. Science 286:509\u2013512","journal-title":"Science"},{"key":"13017_CR12","unstructured":"Barnad ST, Small I (1990) Animation at the Interface: the art of human computer Interface design 251-267"},{"issue":"11","key":"13017_CR13","first-page":"1587","volume":"17","author":"V Batagelj","year":"2011","unstructured":"Batagelj V, Brandenburg FJ, Didimo W (2011) Visual analysis of large graphs using (X, Y)- clustering and hybrid visualizations. IEEE Trans Knowl Data Eng 17(11):1587\u20131598","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"13017_CR14","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1021\/ci0200570","volume":"43","author":"G Benk\u00f6","year":"2003","unstructured":"Benk\u00f6 G, Flamm C, Stadler PF (2003) A graph-based toy model of chemistry. J Chem Inf Comput Sci 43:1085\u20131093","journal-title":"J Chem Inf Comput Sci"},{"key":"13017_CR15","volume-title":"Graph and network data: mining the temporal dimension","author":"M Berlingerio","year":"2009","unstructured":"Berlingerio M (2009) Graph and network data: mining the temporal dimension. IMT Institute for Advanced Studies, Lucca"},{"key":"13017_CR16","volume-title":"Use of watersheds in contour detection. in International Workshop on Image Processing","author":"S Beucher","year":"1979","unstructured":"Beucher S, Lantu\u00e9joul C (1979) Use of watersheds in contour detection. in International Workshop on Image Processing. Real-Time Edge and Motion Detection\/Estimation, Rennes"},{"issue":"3","key":"13017_CR17","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1145\/882262.882364","volume":"22","author":"J Bolz","year":"2003","unstructured":"Bolz J, Farmer I, Grinspun E, Schrooder P (2003) Sparse matrix solvers on the GPU: conjugate gradients and multigrid. ACM Trans Graphics (TOG) 22(3):917\u2013924","journal-title":"ACM Trans Graphics (TOG)"},{"key":"13017_CR18","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1126\/science.1165821","volume":"323","author":"SP Borgatti","year":"2009","unstructured":"Borgatti SP, Mehra A, Brass DJ, Labianca G (2009) Network analysis in the social sciences. Science 323:892\u2013895","journal-title":"Science"},{"key":"13017_CR19","unstructured":"Brath R, Jonker D (n.d.) Graph Analysis and Visualization: Discovering Business Opportunity in Linked Data. John Wiley & Sons, ISBN-10: 1118845846, ISBN-13: 978\u20131118845844"},{"key":"13017_CR20","unstructured":"Bui T, Jones C (1993) A heuristic for reducing fill in sparse matrix factorization. In6th SIAM Conf. Parallel processing for scientific Computing 445\u2013452"},{"issue":"6","key":"13017_CR21","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/TPAMI.2012.226","volume":"35","author":"SR Bul\u00f2","year":"2013","unstructured":"Bul\u00f2 SR, Pelillo M (2013) A game-theoretic approach to hyper graph clustering. IEEE Trans Pattern Anal Mach Intell 35(6):1312\u20131327","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"13017_CR22","doi-asserted-by":"crossref","unstructured":"Callut J, Fraisse K, Saerens M, Dupont P (2008) Semi-supervised classification from discriminative random walks. Lecture notes in artificial intelligence no. 5211, springer 162-177","DOI":"10.1007\/978-3-540-87479-9_29"},{"key":"13017_CR23","doi-asserted-by":"crossref","unstructured":"Callut J, Fran\u00e7oisse K, Saerens M, Dupont P (2008) Semi-supervised Classification from Discriminative Random Walks. Lecture Notes in Artificial Intelligence No. 5211, Springer 162\u2013177","DOI":"10.1007\/978-3-540-87479-9_29"},{"key":"13017_CR24","unstructured":"Carpendale GS (2003) Edge Lens: An Interactive Method For Managing Edge Congestion In Graphs. Information Visualization INFOVIS 2003. IEEE Symposium 51\u201358"},{"issue":"8","key":"13017_CR25","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1109\/71.605773","volume":"8","author":"O Chao-Wei","year":"1999","unstructured":"Chao-Wei O, Ranka S (1999) Parallel incremental graph partitioning. IEEE Transactions on Parallel and Distributed Systems 8(8):884\u2013896","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"13017_CR26","volume-title":"Applied and algorithmic graph theory","author":"G Chartrand","year":"1993","unstructured":"Chartrand G, Oellermann OR (1993) Applied and algorithmic graph theory. McGraw-Hill, New York"},{"key":"13017_CR27","doi-asserted-by":"crossref","unstructured":"Charu Aggarwal C (n.d.) Managing and Mining Graph Data. Springer 2010 edition, ISBN-10: 1441960449, ISBN-13: 978\u20131441960443","DOI":"10.1007\/978-1-4419-6045-0_2"},{"key":"13017_CR28","doi-asserted-by":"crossref","unstructured":"Charu Aggarwal C, Wang H, (n.d.) Managing and Mining Graph Data (Advances in Database Systems). Springer 2010 edition, ISBN-10: 1441960449, ISBN-13: 978\u2013144196044","DOI":"10.1007\/978-1-4419-6045-0_2"},{"key":"13017_CR29","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1109\/71.605773","volume":"8","author":"O Chaw Wei","year":"1997","unstructured":"Chaw Wei O, Ranka S (1997) Parallel Incremental Graph Partitioning. IEEE transactions on Parallel and Distributed Systems 8:884\u2013896","journal-title":"IEEE transactions on Parallel and Distributed Systems"},{"key":"13017_CR30","unstructured":"Chen Y, Fonseca F (2004) A bipartite graph co-clustering approach to ontology mapping"},{"issue":"12","key":"13017_CR31","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/43.103500","volume":"10","author":"C-K Cheng","year":"1991","unstructured":"Cheng C-K, Wei Y-CA (1991) An improved two-way partitioning algorithm with STABLE performance. IEEE Transactions on Computer Aided Design 10(12):1502\u20131511","journal-title":"IEEE Transactions on Computer Aided Design"},{"key":"13017_CR32","unstructured":"Clique BD (2008) Matrices for Statistical Graph Decomposition and Paramenite Matrices. In D. A. McAllester and P. Myllymaki, editors AUAI Press 26\u201333"},{"key":"13017_CR33","unstructured":"Cloudgraph. (n.d.) http:\/\/www.cloudgraph.com\/"},{"key":"13017_CR34","doi-asserted-by":"crossref","unstructured":"Corradini A, Montanari U, Rossi F, Ehrig H, Heckel R, L\u00f6we M (1997) Algebraic Approaches To Graph Transformation. Part I: Basic concepts and double pushout approach, in: G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations, World Scientific 163\u2013246","DOI":"10.1142\/9789812384720_0003"},{"key":"13017_CR35","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"H David","year":"1987","unstructured":"David H (1987) Statecharts: a visual formalism for complex systems. Science Computer Programming 8:231\u2013274","journal-title":"Science Computer Programming"},{"key":"13017_CR36","doi-asserted-by":"crossref","unstructured":"Delest M, Bordeaux F, Fedou JM, Antipolis NS, Jean-Marc F, Melancon G, Montpellier F (2006) A Quality Measure for Multi-Level Community Structure. SYNASC 8th International Conference","DOI":"10.1109\/SYNASC.2006.9"},{"key":"13017_CR37","unstructured":"Dey S (n.d.) Graph Theory with Applications. Shroff, 1st Edition, ISBN-10: 9350236796, ISBN-13: 978\u20139350236796"},{"key":"13017_CR38","doi-asserted-by":"crossref","unstructured":"Dhillon I, Guan Y, Kulis B (2005) A Fast Kernel-based Multilevel Algorithm for Graph Clustering. Proceedings of The 11th ACM SIGKDD, Chicago, IL, 21\u201324","DOI":"10.1145\/1081870.1081948"},{"key":"13017_CR39","unstructured":"Diane Cook J, Lawrence Holder B, (n.d.) Mining Graph Data. Wiley-Blackwell, ISBN-10: 0471731900, ISBN-13: 978\u20130471731900"},{"key":"13017_CR40","unstructured":"Dias CR, Ochi LS (2003) Efficient evolutionary algorithms for the clustering problem. L:983-988"},{"key":"13017_CR41","unstructured":"Dias CR, Ochi LS (2003) Efficient evolutionary algorithms for the clustering problem in directed graphs. Proceedings of the 2003 IEEE congress on evolutionary computation 1:983-988"},{"issue":"12","key":"13017_CR42","doi-asserted-by":"publisher","first-page":"2383","DOI":"10.1109\/TPAMI.2011.110","volume":"33","author":"O Duchenne","year":"2011","unstructured":"Duchenne O, Bach F, Kweon IS, Ponce J (2011) A tensor-based algorithm for high-order graph matching. IEEE Trans Pattern Anal Mach Intell 33(12):2383\u20132395","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"13017_CR43","doi-asserted-by":"crossref","unstructured":"Eades P, Feng QW (1996) Multilevel visualization of clustered graphs. Graph drawing. Proc. 4th Int. Symp. GD 101\u2013112","DOI":"10.1007\/3-540-62495-3_41"},{"key":"13017_CR44","doi-asserted-by":"crossref","unstructured":"Eades P, Feng Q (1997) Multilevel visualization of clustered graphs. Proc. symposium on graph drawing 101-112","DOI":"10.1007\/3-540-62495-3_41"},{"key":"13017_CR45","doi-asserted-by":"publisher","first-page":"157","DOI":"10.7155\/jgaa.00029","volume":"4","author":"P Eades","year":"2000","unstructured":"Eades P, Huang ML (2000) Navigating clustered graphs using force-directed methods. Graph Algorithms Appl 4:157\u2013181","journal-title":"Graph Algorithms Appl"},{"key":"13017_CR46","doi-asserted-by":"crossref","unstructured":"Eades P, Feng QW, Lin X (1996) Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Proceedings of the symposium on graph drawing 113\u2013128","DOI":"10.1007\/3-540-62495-3_42"},{"issue":"6","key":"13017_CR47","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1109\/TVCG.2007.70535","volume":"13","author":"G Ellis","year":"2007","unstructured":"Ellis G, Dix A (2007) Taxonomy of clutter reduction for information visualization. IEEE Trans Vis Comput Graph 13(6):1216\u20131223","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"13017_CR48","unstructured":"Elmacioglu E, Lee D (n.d.) On Six Degrees of Separation in DBLP-DB and More"},{"key":"13017_CR49","doi-asserted-by":"crossref","unstructured":"Eppstein D, Goodrich MT, Meng JY (2007) Confluent Layered Drawings AlgorithMica 47(4):439\u2013452","DOI":"10.1007\/s00453-006-0159-8"},{"key":"13017_CR50","doi-asserted-by":"crossref","unstructured":"Estrada E (2013) Chemical Graph Theory. https:\/\/www.researchgate.net\/publication\/258021291, Chapter. 1\u201325","DOI":"10.1201\/b16132-92"},{"key":"13017_CR51","doi-asserted-by":"crossref","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. Proc. ACM Conf. Applications, technologies, architectures, and protocols for computer Communication 251\u2013262","DOI":"10.1145\/316194.316229"},{"key":"13017_CR52","doi-asserted-by":"crossref","unstructured":"Faloutsos C, McCurley KS, Tomkins A (2004) Fast discovery of connection subgraphs. Proc ACM 10th Int\u2019lConf Knowledge discovery and data mining (SIGKDD) 118-127","DOI":"10.1145\/1014052.1014068"},{"key":"13017_CR53","doi-asserted-by":"crossref","unstructured":"Fatat GD, Berthold MR (2005) High performance subgraph Mining in Molecular Compounds. HPCC:866\u2013877","DOI":"10.1007\/11557654_97"},{"issue":"2","key":"13017_CR54","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/B:VISI.0000022288.19776.77","volume":"59","author":"PF Felzenszwalb","year":"2004","unstructured":"Felzenszwalb PF, Huttenlocher DP (2004) Efficient graph-based image Segmentation. Int J Comput Visual 59(2):167\u2013181","journal-title":"Int J Comput Visual"},{"key":"13017_CR55","doi-asserted-by":"crossref","unstructured":"Feng QW, Cohen RF, Eades P (1995) How to draw a planar clustered graph. Proceedings of the first annual international conference on computing and combinatory, 21\u201330","DOI":"10.1007\/BFb0030816"},{"key":"13017_CR56","doi-asserted-by":"crossref","unstructured":"Fiduccia CM, Mattheyses RM (1982) A linear-time heuristic for improving network partitions. In 19th design automation conference (pp 175\u2013181). IEEE","DOI":"10.1109\/DAC.1982.1585498"},{"key":"13017_CR57","unstructured":"Filament. (n.d.) http:\/\/filament.sourceforge.net"},{"key":"13017_CR58","unstructured":"Finocchi I (2002) Hierarchical decompositions for visualizing large graphs. PhD diss., PhD thesis, Universita degli Studi di Roma \u201cLa Sapienza"},{"key":"13017_CR59","doi-asserted-by":"crossref","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"13017_CR60","unstructured":"Takes FW (2014) Algorithms for analyzing and mining real-world graphs. PhD diss., Leiden University"},{"key":"13017_CR61","doi-asserted-by":"crossref","unstructured":"Gao S, Li MM (2014) Research of data graph mining based on telecommunication customers. Appl Mech Mater 443. Trans Tech Publications Ltd","DOI":"10.4028\/www.scientific.net\/AMM.443.402"},{"key":"13017_CR62","doi-asserted-by":"crossref","unstructured":"Garbers J, Promel HJ, Steger A (1990) Finding clusters in VLSI circuits. In 1990 IEEE International Conference on Computer-Aided Design 1990 Jan 1 (pp 520\u2013521). IEEE Computer Society","DOI":"10.1109\/ICCAD.1990.129970"},{"key":"13017_CR63","doi-asserted-by":"crossref","unstructured":"Garey MR, Johnson DS (1983) Crossing number is NP-complete. SIAM J Alg Discr Meth 4(3):312\u2013316","DOI":"10.1137\/0604033"},{"key":"13017_CR64","unstructured":"Gentilini R, Piazza C, Policriti A (2003) Computing strongly connected components in a linear number of symbolic steps. InSODA 3:573\u2013582"},{"key":"13017_CR65","unstructured":"Giraph. (n.d.) https:\/\/github.com\/apache\/giraph"},{"key":"13017_CR66","volume-title":"Matrix computations","author":"GH Golub","year":"1996","unstructured":"Golub GH, Van Loan CF (1996) Matrix computations. John Hopkins University Press Baltimore, Baltimore"},{"key":"13017_CR67","doi-asserted-by":"crossref","unstructured":"Gomez-Rodriguez M, Leskovec J, Krause A (2010) Inferring networks of diffusion and influence. Proc. 16th ACM SIGKDD Int\u2019l Conf. Knowledge discovery and data mining 1019-1028","DOI":"10.1145\/1835804.1835933"},{"key":"13017_CR68","unstructured":"G-store. (n.d.) http:\/\/g-store.sourceforge.net\/"},{"issue":"5","key":"13017_CR69","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TPDS.2013.123","volume":"25","author":"P Guo","year":"2014","unstructured":"Guo P, Wang L, Chen P (2014) A performance modelling and optimization analysis tool for sparse matrix-vector multiplication on GPUs. Parallel and Distributed Systems, IEEE Trans 25(5):1112\u20131123","journal-title":"Parallel and Distributed Systems, IEEE Trans"},{"key":"13017_CR70","unstructured":"Guo G, Wang H, Bell D, Bi Y, Greer K (n.d.) KNN Model-Based Approach in Classification. 1\u201312"},{"key":"13017_CR71","doi-asserted-by":"crossref","unstructured":"Hagen L, Kahng A (1992) A New Approach To Effective Circuit Clustering. In: Proceedings of IEEE International Conference on Computer Aided Design 422\u2013427","DOI":"10.1109\/ICCAD.1992.279334"},{"key":"13017_CR72","unstructured":"Han J, Yan X, Yu PS (2006) Mining and searching graphs and structures. Proceedings of 12th ACM conference on knowledge discovery and data mining (SIGKDD\u20192006)"},{"key":"13017_CR73","first-page":"1","volume":"84112","author":"G Hans Othmer","year":"1981","unstructured":"Hans Othmer G (1981) A graph-theoretic analysis of chemical reaction networks. Department of Mathematics University of Utah Salt Lake City, Utah 84112:1\u201336","journal-title":"Department of Mathematics University of Utah Salt Lake City, Utah"},{"key":"13017_CR74","unstructured":"Haq A (2015) Applying graph mining techniques to solve complex software engineering problems. Kent State University"},{"key":"13017_CR75","unstructured":"Harchaoui Z, Bach F (n.d.) Image Classification with Segmentation Graph Kernels. 1\u20136"},{"key":"13017_CR76","unstructured":"Heath MT, Raghavan P (1994) A Cartesian nested dissection algorithm. Technical report UIUCDCS-R-92-1772, Department of Computer Science, University of Illinois, Urbana, IL 61801, 1992. To appear in SIAM journal on matrix analysis and applications"},{"key":"13017_CR77","unstructured":"Hendrickson B, Leland R (1993) A multilevel algorithm for partitioning graphs. Technical report SAND93-1301, Sandia National Laboratories"},{"key":"13017_CR78","doi-asserted-by":"crossref","unstructured":"Hendrickson B, Leland R (1995) A multilevel Algorithmfor partitioning graphs. Proc. Supercomputing","DOI":"10.1145\/224170.224228"},{"key":"13017_CR79","doi-asserted-by":"crossref","unstructured":"Ho J, Hong SH (2006) Drawing clustered graphs in three dimensions","DOI":"10.1007\/11618058_44"},{"issue":"5","key":"13017_CR80","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TVCG.2006.147","volume":"12","author":"D Holten","year":"2006","unstructured":"Holten D (2006) Visualization of adjacency relations in hierarchical data. IEEE Trans Vis Comput Graph 12(5):741\u2013748","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"13017_CR81","doi-asserted-by":"crossref","unstructured":"Horak Z, Kudelka M, Snasel V, Abraham A, Rezankova H (2011) Forcoa.NET: An Interactive Tool for Exploring the Significance of Authorship networks in dblp data. ieee computer society, IEEE","DOI":"10.1109\/CASON.2011.6085955"},{"key":"13017_CR82","unstructured":"Horak Z, Kudelka M, Snasel V, Abraham A (2011) Forcoa.NET: An Interactive Tool for Exploring the Significance of Authorship Networks in DBLP Data. International Conference on Computational Aspects of Social Networks (CASON) 978\u20131\u20134577-1133-6\/11\/ IEEE, 261\u2013266"},{"key":"13017_CR83","unstructured":"Horton. (n.d.) http:\/\/research.microsoft.com\/en-us\/projects\/ldg\/"},{"key":"13017_CR84","unstructured":"Huang DH, Kahng AB (1995) When clusters meet partitions: new density-based methods for circuit decomposition. In: Proc Eur Conf Des Test 60\u201364"},{"key":"13017_CR85","doi-asserted-by":"crossref","unstructured":"Huang ML, Nguyen QV (2007) A space efficient clustered visualization of large graphs. Proc. fourth Int\u2019l Conf. Image and graphics 920-927","DOI":"10.1109\/ICIG.2007.10"},{"issue":"11","key":"13017_CR86","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1109\/TPAMI.2007.1115","volume":"29","author":"S Inderjit Dhilon","year":"2007","unstructured":"Inderjit Dhilon S, Guan Y, Kuli B (2007) Weighted graph cuts without eigenvectors: a multilevel approach. IEEE Trans Pattern Anal Mach Intell 29(11):1944\u20131957","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"13017_CR87","first-page":"6201","volume":"37","author":"M Jalali","year":"2010","unstructured":"Jalali M, Mustapha N, Sulaiman MN, Mamat A (2010) Expert systems with applications. Elsevier 37:6201\u20136212","journal-title":"Elsevier"},{"key":"13017_CR88","unstructured":"JayantKulkarni S (2017) Graph theory: applications to chemical engineering and chemistry. Galore Int J Appl Sci Human"},{"key":"13017_CR89","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TKDE.2011.199","volume":"25","author":"F Jose Rodrigues Jr","year":"2013","unstructured":"Jose Rodrigues F Jr, Pan J-Y, Agma Traina JM, Traina C Jr, Faloutsos C (2013) Large graph analysis in the Gmine system. IEEE Trans Knowl Data Eng 25:106\u2013119","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"13017_CR90","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1109\/TKDE.2012.244","volume":"26","author":"U Kang","year":"2014","unstructured":"Kang U, Meeder B, Papalexakis EE, Faloutsos C (2014) Heigen: spectral analysis for billion-scale graphs. Knowl Data Eng IEEE Trans 26(2):350\u2013362","journal-title":"Knowl Data Eng IEEE Trans"},{"issue":"3","key":"13017_CR91","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R Kannan","year":"2004","unstructured":"Kannan R, Vempala S, Vetta A (2004) On Clustering\u2019s good, bad and spectral. J ACM 51(3):497\u2013515","journal-title":"J ACM"},{"key":"13017_CR92","doi-asserted-by":"crossref","unstructured":"Kappes JH, Speth M, Andres B, Reinelt G, Schn C (2011) Globally optimal image partitioning by multi-cuts. In: Proc. energy minim. Methods computation. Vis. Pattern Recognition 31\u201344","DOI":"10.1007\/978-3-642-23094-3_3"},{"key":"13017_CR93","unstructured":"Karpys G, Kumar V (1995) Metis: unstructured graph partitioning and sparse matrix ordering system. Version 2.0, University of Minnesota"},{"key":"13017_CR94","doi-asserted-by":"crossref","unstructured":"Karypis G, Kumar V (1995) Multilevel graph partitioning schemes. Proc IEEE\/ ACM conf Parallel processing 113\u2013122","DOI":"10.1145\/224170.224229"},{"key":"13017_CR95","doi-asserted-by":"crossref","unstructured":"Karypis G, Kumar V (1998) Multilevel algorithms for multi-constraint graph partitioning. Supercomputing 1998. SC98. IEEE\/ACM conference 28\u201328","DOI":"10.1109\/SC.1998.10018"},{"key":"13017_CR96","unstructured":"Kashima H, Inokuchi A (2002) Kernels for graph classification. ICDM, Workshop on Active Mining"},{"key":"13017_CR97","doi-asserted-by":"publisher","first-page":"84","DOI":"10.4018\/ijkbo.2013100105","volume":"3","author":"M Kazimianec","year":"2013","unstructured":"Kazimianec M, Augsten N (2013) Clustering with proximity graphs: exact and efficient algorithms. International Journal of Knowledge based Organizations 3:84\u2013104","journal-title":"International Journal of Knowledge based Organizations"},{"issue":"2","key":"13017_CR98","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal 49(2):291\u2013307","journal-title":"Bell System Technical Journal"},{"key":"13017_CR99","doi-asserted-by":"crossref","unstructured":"Ketkar NS, Holder LB, Cook OJ (2009) Empirical comparison of graph classification algorithms. IEEE","DOI":"10.1109\/CIDM.2009.4938658"},{"key":"13017_CR100","doi-asserted-by":"crossref","unstructured":"Khuller S, Saha B (2009) On finding dense subgraphs. In: Proc. automata languages Program 597\u2013608","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"13017_CR101","doi-asserted-by":"crossref","unstructured":"Kim S (2003) Graph theoretic sequence clustering algorithms and their applications to genome comparison. in: J.T.L. Wang, C.H. Wu, P.P. Wang (Eds.), Computational Biology and Genome Informatics, World Scientific Publishing Company 81\u2013116","DOI":"10.1142\/9789812564498_0004"},{"key":"13017_CR102","unstructured":"Kim S, Nowozin S, Kohli P, Yoo CD (2011) Higher-order correlation clustering for image Segmentation. In: Proc. Adv. Neural Inf. Process. System 1530\u20131538"},{"key":"13017_CR103","unstructured":"Kramer S, Raedt. LD (2001) Feature Construction With Version Spaces For Biochemical Application. In Proc. of the 18th ICML"},{"key":"13017_CR104","unstructured":"Kraus JM, Palm G, Kestler HA (2007) On the robustness of semi supervised hierarchical graph clustering in functional genomics"},{"key":"13017_CR105","doi-asserted-by":"crossref","unstructured":"Krishnamurthy V, Faloutsos M, Chrobak M, Lao L, Cui JH, Percus AG (2005) Reducing large internet topologies for faster simulations. IFIP Networking","DOI":"10.1007\/11422778_27"},{"key":"13017_CR106","doi-asserted-by":"crossref","unstructured":"Kudelka M, ZdenekHorak VS, Abraham A (2010) Social network reduction based on stability. IEEE Computer Society, IEEE","DOI":"10.1109\/CASoN.2010.120"},{"key":"13017_CR107","doi-asserted-by":"crossref","unstructured":"Kudelka M, Horak Z, Snasel V, Abraham A (2010) Social Network Reduction Based on Stability. International Conference on Computational Aspects of Social Networks 510\u2013514","DOI":"10.1109\/CASoN.2010.120"},{"issue":"5\u20136","key":"13017_CR108","first-page":"98","volume":"15","author":"K Laukens","year":"2014","unstructured":"Laukens K, Naulaerts S, VandenBerghe W (2014) Bioinformatics approaches for the functional interpretation of protein lists: from ontology term enrichment to network analysis. Proteomics 15(5\u20136):98\u2013196","journal-title":"Proteomics"},{"key":"13017_CR109","doi-asserted-by":"crossref","unstructured":"Le TV, Kulikowaski CA, Muchnik IB (2008) Coring method for clustering a graph. In: Proceedings of IEEE","DOI":"10.1109\/ICPR.2008.4760954"},{"key":"13017_CR110","doi-asserted-by":"crossref","unstructured":"Lee J, Cho M, Lee KM (2011) Hyper graph matching via reweighted random walks. In proc. IEEE Conf. Computation visualization pattern recognition 1633\u20131640","DOI":"10.1109\/CVPR.2011.5995387"},{"key":"13017_CR111","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining 631\u2013636","DOI":"10.1145\/1150402.1150479"},{"key":"13017_CR112","doi-asserted-by":"crossref","unstructured":"Ley M (2009) DBLP- some lessons learned. VLDB, August","DOI":"10.14778\/1687553.1687577"},{"key":"13017_CR113","first-page":"655","volume":"10","author":"F Lin","year":"2010","unstructured":"Lin F, Cohen WW (2010) Power iteration clustering. In proc. Int. Conf. Mach. Learn 10:655\u2013662","journal-title":"Learn"},{"key":"13017_CR114","doi-asserted-by":"crossref","unstructured":"Liu W, Li Z, Sun S, Gupta M, (2021) Design a novel target to improve positioning accuracy of autonomous vehicle navigation system in GPS denied environments IEEE transactions on industrial informatics","DOI":"10.1109\/TII.2021.3052529"},{"key":"13017_CR115","doi-asserted-by":"crossref","unstructured":"Lombaert Herve, Yiyong Sun, Leo Grady, Chenyang Xu (2005) A Multilevel Banded Graph Cuts Method for Fast Image Segmentation. Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV, 1550\u20135499\/05 $20.00 \u00a9 2005 IEEE\u201905)","DOI":"10.1109\/ICCV.2005.13"},{"key":"13017_CR116","doi-asserted-by":"publisher","first-page":"716","DOI":"10.14778\/2212351.2212354","volume":"5","author":"Y Low","year":"2012","unstructured":"Low Y, Bickson D, Gonzalez J, Guestrin C, Kyrola A, Hellerstein JM (2012) Distributed graph lab: a framework for machine learning and data mining in the cloud. Proc VLDB Endowment 5:716\u2013727","journal-title":"Proc VLDB Endowment"},{"issue":"2","key":"13017_CR117","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe DG (2004) Distinctive image features from scale-invariant Keypoints. Int J Comput Visual 60(2):91\u2013110","journal-title":"Int J Comput Visual"},{"key":"13017_CR118","doi-asserted-by":"publisher","first-page":"5822","DOI":"10.1109\/JIOT.2020.3034221","volume":"8","author":"Y Ma","year":"2020","unstructured":"Ma Y, Li Z, Malekian R, Zheng S, Sotelo MA (2020) A Novel Multimode Hybrid Control Method for Cooperative Driving of an Automated Vehicle Platoon. IEEE Internet Things J 8:5822\u201358-38","journal-title":"IEEE Internet Things J"},{"key":"13017_CR119","first-page":"935","volume":"8","author":"S Macskassy","year":"2007","unstructured":"Macskassy S, Provost F (2007) Classification in networked data: a toolkit and a univariate case study. J Mach Learn Res 8:935\u2013983","journal-title":"J Mach Learn Res"},{"key":"13017_CR120","doi-asserted-by":"crossref","unstructured":"Malcolm J, Rathi Y, Tannenbaum A (2007) Graph Cut Segmentation with Nonlinear Shape Priors. IEEE international conference on ICIP 365\u2013368.","DOI":"10.1109\/ICIP.2007.4380030"},{"key":"13017_CR121","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJ, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proc. ACM SIGMOD Int Conf Manage Data 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"key":"13017_CR122","doi-asserted-by":"crossref","unstructured":"Mancoridis S, Mitchell BS, Chen Y, Gansner ER (1999) Bunch: a clustering tool for the recovery and maintenance of software system structures. Software maintenance. 1999.(ICSM\u201999) proceedings. IEEE international conference 50\u201359","DOI":"10.1109\/ICSM.1999.792498"},{"key":"13017_CR123","doi-asserted-by":"crossref","unstructured":"Mansurul Bhuiyan A, Mohammad Al Hasan (2013) An iterative map reduce based frequent subgraph mining algorithm. Trans Knowl Data Eng","DOI":"10.1109\/BigData.Congress.2014.12"},{"key":"13017_CR124","doi-asserted-by":"crossref","unstructured":"MarziehAyati SE, Mark Chance R, Koyutrk M (2015) MOBAS: identification of disease-associated protein sub networks using modularity-based scoring. J Bioinf Systems Bio","DOI":"10.1186\/s13637-015-0025-6"},{"issue":"6","key":"13017_CR125","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1093\/molbev\/mst029","volume":"30","author":"P Meysman","year":"2013","unstructured":"Meysman P, Sanchez-Rodrguez A, Fu Q, Marchal K, Engelen K (2013) Expression divergence between Escherichia Coli and Salmonella EntericaSerovarTyphimuriumReflects their lifestyles. Mol Biol Evol 30(6):1302\u20131314","journal-title":"Mol Biol Evol"},{"key":"13017_CR126","unstructured":"Meysman P, Saeys Y, Sabaghian E, Bittremieux W, Van de Peer Y, Goethals B, Laukens K (2016) Mining the enriched subgraphs for specific vertices in a biological graph. IEEE\/ACM, Trans Comput Bio Bioinf"},{"key":"13017_CR127","unstructured":"Meysman P, YvanSaeys ES, WoutBittremieux YVde P, Goethals B, Laukens K (2016) Mining the enriched subgraphs for specific vertices in a biological graph. IEEE\/ACM Transactions On Computational Biology And Bioinformatics"},{"key":"13017_CR128","doi-asserted-by":"publisher","first-page":"257","DOI":"10.4137\/CIN.S680","volume":"6","author":"T Milenkovic","year":"2008","unstructured":"Milenkovic T, Przulj N (2008) Uncovering biological network function via Graphlet degree signatures. Cancer Informat 6:257\u2013273","journal-title":"Cancer Informat"},{"key":"13017_CR129","doi-asserted-by":"crossref","unstructured":"Motoda H (2006) What can we do with graph-structured data a data mining perspective. Springer 1-2","DOI":"10.1007\/11941439_1"},{"key":"13017_CR130","doi-asserted-by":"crossref","unstructured":"Mukherjea S, Foley JD, Hudson SE (1995) Visualizing complex hypermedia networks through multiple hierarchical views","DOI":"10.1145\/223904.223947"},{"key":"13017_CR131","doi-asserted-by":"crossref","unstructured":"Newbery FJ (1989) Edge connection: a method for clustering directed graphs. Proceeding of 2nd international workshop on software configuration management 76-85","DOI":"10.1145\/72910.73350"},{"key":"13017_CR132","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"M Newman","year":"2005","unstructured":"Newman M (2005) A measure of betweenness centrality based on random walks. Soc Networks 27:39\u201354","journal-title":"Soc Networks"},{"issue":"23","key":"13017_CR133","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"M Newman","year":"2006","unstructured":"Newman M (2006) Modularity and community structure in networks. Proc Nat Acad Sci 103(23):8577\u20138582","journal-title":"Proc Nat Acad Sci"},{"key":"13017_CR134","first-page":"849","volume":"2","author":"AY Ng","year":"2002","unstructured":"Ng AY, Jordan MI, Weiss Y (2002) On spectral clustering: analysis and an algorithm. Adv Neural Inf Process System 2:849\u2013856","journal-title":"Adv Neural Inf Process System"},{"key":"13017_CR135","first-page":"291","volume-title":"Solving finite element equations on concurrent computers","author":"B Nour-Omid","year":"1986","unstructured":"Nour-Omid B, Raefsky A, Lyzenga G (1986) Solving finite element equations on concurrent computers. In: Noor AK (ed) . American Soc. Mech. Eng, pp 291\u2013307"},{"key":"13017_CR136","unstructured":"Orientdb. (n.d.) http:\/\/www.orientdb.org\/"},{"key":"13017_CR137","doi-asserted-by":"crossref","unstructured":"Ozaki T, Ohkawa T (2008) Mining correlated subgraphs in graph databases. PAKDD 272-283","DOI":"10.1007\/978-3-540-68125-0_25"},{"key":"13017_CR138","volume-title":"Combinatorial optimization: algorithms and complexity","author":"C Papadimitriou","year":"1998","unstructured":"Papadimitriou C, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Dover, Mineola"},{"key":"13017_CR139","doi-asserted-by":"crossref","unstructured":"Peng J, Xiao Z, Chen C, Yang W (2016) Iterative Sparse Matrix-Vector Multiplication on In-Memory Cluster Computing Accelerated by GPUs for Big Data. IEEE 978\u20131\u20135090-4093-3\/16\/, \u00a92016","DOI":"10.1109\/FSKD.2016.7603391"},{"key":"13017_CR140","unstructured":"Phan D, Xiao L, Yeh R, Hanrahan P, Winograd T (2005) Flow map layout. IEEESymposium on Inf Visual INFOVIS:219\u2013224"},{"key":"13017_CR141","unstructured":"Phoebus. (n.d.) https:\/\/github.com\/xslogic\/phoebus"},{"key":"13017_CR142","doi-asserted-by":"crossref","unstructured":"Ponnusamy R, Mansour N, Choudhary A, Fox GC (1993) Graph contraction and physical optimization methods: a quality-cost trade off for mapping data on parallel computers. In International Conference of Supercomputing","DOI":"10.1145\/165939.165942"},{"key":"13017_CR143","unstructured":"Porikli F (2013) Integral Histogram: A Fast Way To Extract Histograms In Cartesian Spaces in Proc IEEE Conf Computation Vis Pattern Recognition 1"},{"issue":"3","key":"13017_CR144","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A Pothen","year":"1990","unstructured":"Pothen A, Horst Simon D, Liou K-P (1990) Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis and Applications 11(3):430\u2013452","journal-title":"SIAM Journal of Matrix Analysis and Applications"},{"key":"13017_CR145","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A Pothen","year":"1990","unstructured":"Pothen A, Simon HD, Liou KP (1990) Partitioning sparse matrices with Eigen- vectors of graphs. SIAM J Matrix Anal 11:430\u2013452","journal-title":"SIAM J Matrix Anal"},{"issue":"2","key":"13017_CR146","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1109\/TNET.2012.2217152","volume":"21","author":"V Preciado","year":"2013","unstructured":"Preciado V, Jadbabaie A (2013) Moment-based spectral analysis of large-scale networks using local structural information. IEEE\/ACM Trans Netw 21(2):373\u2013382","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"13017_CR147","doi-asserted-by":"publisher","first-page":"e177","DOI":"10.1093\/bioinformatics\/btl301","volume":"23","author":"N Przulj","year":"2007","unstructured":"Przulj N (2007) Biological network comparison using Graphlet degree distribution. Bioinformatics 23(2):e177\u2013e183","journal-title":"Bioinformatics"},{"issue":"10","key":"13017_CR148","first-page":"2466","volume":"26","author":"M Rahman","year":"2014","unstructured":"Rahman M, Bhuiyan MA, Al Hassan M (2014) GRAFT: an efficient Graphlet counting method for large graph analysis. IEEE Trans Pattern Anal Mach Intell 26(10):2466\u20132478","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"13017_CR149","unstructured":"Ramon J (n.d.) Graph mining declarative languages and artificial intelligence group. K. U. Leuven, Belgium"},{"key":"13017_CR150","doi-asserted-by":"crossref","unstructured":"Rehman SU, Khan AU, Khan AU (n.d.) Graph Mining: A Survey of Graph Mining Techniques. \u00a92012 IEEE 978\u20131\u20134673-2430-4112","DOI":"10.1109\/ICDIM.2012.6360146"},{"issue":"5","key":"13017_CR151","first-page":"695","volume":"53","author":"JS Risch","year":"2006","unstructured":"Risch JS, Rex DB, Dowson ST, Walters TB, May RA, Moon BD (2006) The starlight information visualizations of web content. Int J Hum Comput Stud 53(5):695\u2013714","journal-title":"Int J Hum Comput Stud"},{"key":"13017_CR152","unstructured":"Rodrigues Jr. JF, Tong H, Traina AJM, Faloutsos C, Leskovec J (2006) GMine: A System for Scalable, Interactive Graph Visualization and Mining. Proc. 32nd Int\u2019l Conf. Very Large Data Bases (VLDB) 1195\u20131198"},{"key":"13017_CR153","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.entcs.2004.12.033","volume":"127","author":"F Rossell\u2019O","year":"2005","unstructured":"Rossell\u2019O F, Valiente G (2005) Chemical graphs, chemical reaction graphs, and chemical graph transformation. Elsevier, Electronic Notes in Theoretical Computer Science 127:157\u2013166","journal-title":"Elsevier, Electronic Notes in Theoretical Computer Science"},{"key":"13017_CR154","unstructured":"Sablowski R, Frick A (n.d.) Automatic Graph Clustering. Proc. of 4th Symposium on Graph Drawing 395\u2013400"},{"key":"13017_CR155","doi-asserted-by":"crossref","unstructured":"Saha B, Hoch A, Khuller S, Raschid L, Zhang XN (2010) Dense subgraphs with restrictions and applications to gene annotation graphs. In proc. res. Computation Mol Biol 456\u2013472","DOI":"10.1007\/978-3-642-12683-3_30"},{"key":"13017_CR156","first-page":"22","volume":"22:1","author":"S Salihoglu","year":"2013","unstructured":"Salihoglu S, Widom J (2013) GPS: a graph processing system. In: Proc. 25th Int. Conf. Sci. Statist. Database Manage 22:1:22\u201312","journal-title":"Database Manage"},{"key":"13017_CR157","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer SE (2007) Graph clustering. Computer Science Review 1:27\u201364","journal-title":"Computer Science Review"},{"key":"13017_CR158","doi-asserted-by":"crossref","unstructured":"Schaeffer SE (2007) Survey graph clustering. Else wire 27\u201364","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"13017_CR159","unstructured":"Schenker A, Last M, Bonke H, Kandel A (2003) Classification of web documents using a graph mode. Proceedings of the Seventh International Conference on Document Analysis and Recognition"},{"key":"13017_CR160","doi-asserted-by":"crossref","unstructured":"Seo S, Yoon EJ, Kim J, Jin S, Kim JS, Maeng S (2010) Hama: an efficient matrix computation with the mapreduce framework. In cloud computing technology and science (CloudCom), 2010 IEEE second international conference on. IEEE 721\u2013726","DOI":"10.1109\/CloudCom.2010.17"},{"key":"13017_CR161","doi-asserted-by":"crossref","unstructured":"Shao B, Wang H, Li Y (2013) Trinity: a distributed graph engine on a memory cloud. In: Proc. ACM SIGMOD Int. Conf. Manage. Data 505\u2013516","DOI":"10.1145\/2463676.2467799"},{"key":"13017_CR162","first-page":"1","volume":"73","author":"J Shi","year":"1997","unstructured":"Shi J, Malik J (1997) Normalized cuts and image Segmentation. In IEEE Conference on Computer Vision and Pattern Recognition 73:1\u2013737","journal-title":"In IEEE Conference on Computer Vision and Pattern Recognition"},{"issue":"8","key":"13017_CR163","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image Segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888\u2013905","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"13017_CR164","unstructured":"Shiy J, Malik J (n.d.) Normalized Cuts and Image Segmentation. Supported by (ARO) DAAH04\u201396-1-0341"},{"key":"13017_CR165","first-page":"345","volume":"1","author":"D Snow","year":"2000","unstructured":"Snow D, Viola P, Zabih R (2000) Exact voxel occupancy with graph cuts. In IEEE Conference on Computer Vision, and Pattem Recognition 1:345\u2013352","journal-title":"In IEEE Conference on Computer Vision, and Pattem Recognition"},{"issue":"2","key":"13017_CR166","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/cpe.4330060203","volume":"6","author":"T Stephan Barnad","year":"1994","unstructured":"Stephan Barnad T, Horst Simon D (1994) Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience 6(2):101\u2013117","journal-title":"Concurrency: Practice and Experience"},{"key":"13017_CR167","doi-asserted-by":"crossref","unstructured":"Sugiyama K, Misue K (1991) Visualization of structural information: automatic drawing of compound digraphs. IEEE Trans Syst Man Cybern 21(4):876\u2013892","DOI":"10.1109\/21.108304"},{"key":"13017_CR168","unstructured":"Swell M (2009) Kernel methods"},{"key":"13017_CR169","unstructured":"Tony Chan F, John Gilbert R, Teng S-H (1994) Geometric spectral partitioning. Technical Report in Preparation"},{"key":"13017_CR170","unstructured":"van Ham F, van Wijk JJ (2004) Interactive visualization of Small world graphs. Proc. IEEE symposium information visualization (information visualization) 199-206"},{"key":"13017_CR171","doi-asserted-by":"crossref","unstructured":"van Ham F, van Wijk JJ, Eindhoven TU (2004) Interactive visualization of Small world graphs. Information visualization. 2004, INFOVIS 2004. IEEE symposium 199\u2013206","DOI":"10.1109\/INFVIS.2004.43"},{"key":"13017_CR172","doi-asserted-by":"crossref","unstructured":"Veksler O (2008) Star shape prior for graph-cut image Segmentation. Proceeding of the 10th European conference on computer vision","DOI":"10.1007\/978-3-540-88690-7_34"},{"key":"13017_CR173","unstructured":"Vertexdb. (n.d.) http:\/\/www.dekorte.com\/projects\/opensource\/vertexdb\/"},{"issue":"2","key":"13017_CR174","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"JS Vitter","year":"2001","unstructured":"Vitter JS (2001) External memory algorithms and data structures: dealing with massive data. ACM Computing Survey 33(2):209\u2013271","journal-title":"ACM Computing Survey"},{"key":"13017_CR175","unstructured":"Wang L (2006) Comparison for edge detection of Colony image. IJCSNS, Int J Comput Sci Netw Security 6(9A)"},{"key":"13017_CR176","unstructured":"Wang S, Xiao CL, Liu W (2006) Parallel Enumeration of Custom Instructions Based on Multi depth Graph Partitioning. IEEE Embedded Systems 1\u20134"},{"key":"13017_CR177","doi-asserted-by":"crossref","unstructured":"Wattenberg M (2006) Visual exploration of multivariate graphs. Proceedings of the SGCHI conference on human factors in computing system 811-819","DOI":"10.1145\/1124772.1124891"},{"key":"13017_CR178","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of Small- world\u2019 networks. Nature 393:440\u2013442","journal-title":"Nature"},{"key":"13017_CR179","unstructured":"Watts DJ, Worlds S (2003) The dynamics of networks between order and randomness. Princeton Univ. Press"},{"issue":"9","key":"13017_CR180","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1093\/bioinformatics\/btl038","volume":"22","author":"S Wernicke","year":"2006","unstructured":"Wernicke S, Rasche F (2006) FANMOD: a tool for fast network motif detection. Bioinformatics (Oxford, England) 22(9):115\u2013123","journal-title":"Bioinformatics (Oxford, England)"},{"issue":"9","key":"13017_CR181","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1093\/bioinformatics\/btl038","volume":"22","author":"S Wernicke","year":"2006","unstructured":"Wernicke S, Rasche F (2006) Fanmod: a tool for fast network motif detection. Bioinformatics 22(9):1152\u20131153","journal-title":"Bioinformatics"},{"key":"13017_CR182","doi-asserted-by":"crossref","unstructured":"Wernicke S, Rasche F (2006) FANMOD: a tool for fast network motif detection Bioinf7ormatics. (Oxford, England) 22(9):115\u2013123","DOI":"10.1093\/bioinformatics\/btl038"},{"key":"13017_CR183","unstructured":"Westbrook JD, Fitzgerald PMD, The PDB (n.d.) Format, Mmcif Formats And Other Data Formats"},{"key":"13017_CR184","doi-asserted-by":"crossref","unstructured":"Wu X, Wang Y (2008) Interactive For reground\/Background Segmentation Based on Graph Cut. Congress on Image and Signal processing 692\u2013696","DOI":"10.1109\/CISP.2008.387"},{"key":"13017_CR185","doi-asserted-by":"crossref","unstructured":"Wu MQY, Faris R, Ma K-L (2015) Visual exploration of academic career paths. 2013, IEEE\/ ACM International Conference on Advances in Social Networks Analysis and Mining 779\u2013786","DOI":"10.1145\/2492517.2492638"},{"key":"13017_CR186","doi-asserted-by":"crossref","unstructured":"Xuan J, Lu J, Zhang G, Luo X (2015) Topic model for graph mining. IEEE Transactions on Cybernetics 2168\u20132267","DOI":"10.1109\/TCYB.2014.2386282"},{"issue":"4","key":"13017_CR187","doi-asserted-by":"publisher","first-page":"231","DOI":"10.14778\/1938545.1938548","volume":"4","author":"X Yang","year":"2011","unstructured":"Yang X, Parthasarathy S, Sadayappan P (2011) Fast sparse matrix-vector multiplication on Gpus: implications for graph mining. Proceedings of the VLDB Endowment 4(4):231\u2013242","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"6","key":"13017_CR188","doi-asserted-by":"publisher","first-page":"1224","DOI":"10.1109\/TVCG.2007.70515","volume":"13","author":"J Stasko","year":"2007","unstructured":"Stasko J, Yi JS, Kang Y n, Jacko JA (2007) Toward a deeper understanding of the role of interaction in information visualization. IEEE Trans Vis Comput Graph 13(6):1224\u20131231","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"13017_CR189","doi-asserted-by":"crossref","unstructured":"Yi F, Moon I, Segmentation I (2012) A Survey of Graph-cut Methods. 2012 International Conference on Systems and Informatics (ICSAI 2012), 978\u20131\u20134673-0199 \/12\u00a92012 IEEE, 1936\u20131941","DOI":"10.1109\/ICSAI.2012.6223428"},{"key":"13017_CR190","doi-asserted-by":"crossref","unstructured":"Yu Z, Xu M, Gao Z (2011) Biomedical image segmentation via constrained graph cuts and presegmentation. International conference of the IEEE on EMBC 5714-5717,","DOI":"10.1109\/IEMBS.2011.6091383"},{"key":"13017_CR191","unstructured":"Yuri Y Marie-Pierre B Jolly Interactive (2001) Graph Cuts for Optimal Boundary &Region Segmentation of Objects in N-D Images. 0\u20137695\u20131143-0\/01"},{"key":"13017_CR192","doi-asserted-by":"crossref","unstructured":"Zass R, Shashua A (2008) Probabilistic graph and hyper graph matching. In proc. IEEE Conf. Comput. Vis. Pattern Recog. 1\u20138","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"13017_CR193","doi-asserted-by":"crossref","unstructured":"Zhao P, Yu X (2007) Mining Closed Frequent Free Trees in Graph Databases. Proceeding of Database Systems for Advance Application 91\u2013102","DOI":"10.1007\/978-3-540-71703-4_10"},{"key":"13017_CR194","unstructured":"Zhou D, Huang J, Sch\u00f6lkopf B (2006) Learning with hyper graphs: Clustering, classification, and embedding. In: Proc. Adv. Neural Inf. Process. System 1601\u20131608"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-022-13017-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-022-13017-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-022-13017-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T19:13:36Z","timestamp":1727291616000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-022-13017-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,23]]},"references-count":194,"journal-issue":{"issue":"30","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["13017"],"URL":"https:\/\/doi.org\/10.1007\/s11042-022-13017-5","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,23]]},"assertion":[{"value":"15 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}