{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:11:45Z","timestamp":1725862305381},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319444024"},{"type":"electronic","value":"9783319444031"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44403-1_18","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T13:35:56Z","timestamp":1470404156000},"page":"287-302","source":"Crossref","is-referenced-by-count":0,"title":["Leveraging Structural Hierarchy for Scalable Network Comparison"],"prefix":"10.1007","author":[{"given":"Rakhi","family":"Saxena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharanjit","family":"Kaur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debasis","family":"Dash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasudha","family":"Bhatnagar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,6]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., l\u00e1szl\u00f3 Barabsi, A.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"18_CR2","first-page":"41","volume":"18","author":"JI Alvarez-Hamelin","year":"2006","unstructured":"Alvarez-Hamelin, J.I., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. Adv. Neural Inf. Process. Syst. 18, 41\u201350 (2006)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"3","key":"18_CR3","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.biosystems.2011.11.004","volume":"107","author":"A Banerjee","year":"2012","unstructured":"Banerjee, A.: Structural distance and evolutionary relationship of networks. Biosystems 107(3), 186\u2013196 (2012)","journal-title":"Biosystems"},{"key":"18_CR4","unstructured":"Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. CoRR cs.DS\/0310049 (2003)"},{"key":"18_CR5","unstructured":"Baur, M., Gaertler, M., Grke, R., Krug, M.: Generating graphs with predefined k-core structure. Technical report, DELIS - Dynamically Evolving, Large-Scale Information Systems (2007)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Berlingerio, M., Koutra, D., Eliassi-Rad, T., Faloutsos, C.: Network similarity via multiple social theories. In: Proceedings of International Conference on ASONAM, pp. 1439\u20131440. IEEE (2013)","DOI":"10.1145\/2492517.2492582"},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1103\/RevModPhys.80.1275","volume":"80","author":"S Dorogovtsev","year":"2008","unstructured":"Dorogovtsev, S., Goltsev, A., Mendes, J.: Critical phenomena in complex networks. Rev. Mod. Phys. 80, 1275 (2008)","journal-title":"Rev. Mod. Phys."},{"key":"18_CR8","first-page":"290","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs I. Publicationes Math. 6, 290\u2013297 (1959). Debrecen","journal-title":"Publicationes Math."},{"key":"18_CR9","unstructured":"Faloutsos, C., Koutra, D., Vogelstein, J.T.: DELTACON: a principled massive-graph similarity function. In: Proceedings of the 13th SIAM International Conference on Data Mining, pp. 162\u2013170 (2013)"},{"issue":"2","key":"18_CR10","first-page":"185","volume":"3","author":"K Faust","year":"2006","unstructured":"Faust, K.: Comparing social networks: size, density and local structure. Adv. Methodol. Stat. 3(2), 185\u2013216 (2006)","journal-title":"Adv. Methodol. Stat."},{"issue":"1","key":"18_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Anal. Appl. 13(1), 113\u2013129 (2010)","journal-title":"Pattern Anal. Appl."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: Evaluating cooperation in communities with the k-core structure. In: Proceedings of International Conference on ASONAM, pp. 87\u201393. IEEE (2011)","DOI":"10.1109\/ASONAM.2011.65"},{"issue":"6804","key":"18_CR13","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1038\/35036627","volume":"407","author":"H Jeong","year":"2000","unstructured":"Jeong, H., Tombor, B., Albert, R., Oltvai, Z.N., Barabasi, A.L.: The large-scale organization of metabolic networks. Nature 407(6804), 651\u2013654 (2000)","journal-title":"Nature"},{"key":"18_CR14","unstructured":"Karwa, V., Pelsmajer, M.J., Petrovic, S., Stasi, D., Wilburne, D.: Statistical models for cores decomposition of an undirected random graph. CoRR abs\/1410.7357 (2014)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Kollias, G., Mohammadi, S., Grama, A.: Network similarity decomposition (NSD): a fast and scalable approach to network alignment. Technical report. Purdue University (2011)","DOI":"10.1109\/TKDE.2011.174"},{"issue":"1","key":"18_CR16","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1), 2 (2007)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"1","key":"18_CR17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/18.61115","volume":"37","author":"J Lin","year":"1991","unstructured":"Lin, J.: Divergence measures based on the shannon entropy. IEEE Trans. Inf. Theory 37(1), 145\u2013151 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Lu, S., Kang, J., Gong, W., Towsley, D.: Complex network comparison using random walks. In: Proceedings of 23rd International WWW Conference, pp. 727\u2013730 (2014)","DOI":"10.1145\/2567948.2579363"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Macindoe, O., Richards, W.: Graph comparison using fine structure analysis. In: Proceedings of the 2nd IEEE International Conference on Social Computing, pp. 193\u2013200 (2010)","DOI":"10.1109\/SocialCom.2010.35"},{"key":"18_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to Information Retrieval","author":"CD Manning","year":"2008","unstructured":"Manning, C.D., Raghavan, P., Sch\u00fctze, H.: Introduction to Information Retrieval. Cambridge University Press, New York (2008)"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: a versatile graph matching algorithm and its application to schema matching. In: Proceedings of the 18th ICDE, pp. 117\u2013128 (2002)","DOI":"10.1109\/ICDE.2002.994702"},{"issue":"2","key":"18_CR22","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/TPDS.2012.124","volume":"24","author":"A Montresor","year":"2013","unstructured":"Montresor, A., Pellegrini, F.D., Miorandi, D.: Distributed k-core decomposition. IEEE Trans. Parallel Distrib. Syst. 24(2), 288\u2013300 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"18_CR23","unstructured":"Peng, C., Kolda, T.G., Pinar, A.: Accelerating community detection by using k-core subgraphs. CoRR abs\/1403.2226 (2014)"},{"key":"18_CR24","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5, 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"issue":"9","key":"18_CR25","doi-asserted-by":"crossref","first-page":"812","DOI":"10.14778\/2311906.2311909","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. Proc. VLDB Endowment 5(9), 812\u2013823 (2012)","journal-title":"Proc. VLDB Endowment"},{"issue":"6684","key":"18_CR26","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44403-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T07:06:06Z","timestamp":1568271966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44403-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319444024","9783319444031"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44403-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}