{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T04:37:10Z","timestamp":1776746230269,"version":"3.51.2"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032052803","type":"print"},{"value":"9783032052810","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T00:00:00Z","timestamp":1758153600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T00:00:00Z","timestamp":1758153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-05281-0_14","type":"book-chapter","created":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T12:48:25Z","timestamp":1758199705000},"page":"217-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Designing Efficient and Scalable Substructure Discovery Algorithms for Multilayer Networks"],"prefix":"10.1007","author":[{"given":"Arshdeep","family":"Singh","sequence":"first","affiliation":[]},{"given":"Abhishek","family":"Santra","sequence":"additional","affiliation":[]},{"given":"Sharma","family":"Chakravarthy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,18]]},"reference":[{"key":"14_CR1","unstructured":"Live-journal. http:\/\/snap.stanford.edu\/data\/com-LiveJournal.html"},{"key":"14_CR2","unstructured":"Agrawal, R., Srikant, R., et\u00a0al.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, vol.\u00a01215, pp. 487\u2013499 (1994)"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1021\/ci00047a033","volume":"25","author":"AT Balaban","year":"1985","unstructured":"Balaban, A.T.: Applications of graph theory in chemistry. J. Chem. Inf. Comput. Sci. 25(3), 334\u2013343 (1985)","journal-title":"J. Chem. Inf. Comput. Sci."},{"issue":"1","key":"14_CR4","first-page":"1","volume":"10","author":"A Berenstein","year":"2016","unstructured":"Berenstein, A., Magarinos, M.P., Chernomoretz, A., Aguero, F.: A multilayer network approach for guiding drug repositioning in neglected diseases. PLoS 10(1), 1\u201333 (2016)","journal-title":"PLoS"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Boden, B., G\u00fcnnemann, S., Hoffmann, H., Seidl, T.: Mining coherent subgraphs in multi-layer graphs with edge labels. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1258\u20131266 (2012)","DOI":"10.1145\/2339530.2339726"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: Proceedings of the 20th international conference on World Wide Web, pp. 587\u2013596. ACM Press","DOI":"10.1145\/1963405.1963488"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: compression techniques. In: Proceedings of the 13th WWW Conference, pp. 595\u2013601 (2004)","DOI":"10.1145\/988672.988752"},{"key":"14_CR8","first-page":"758","volume":"49","author":"NG de Bruijn","year":"1946","unstructured":"de Bruijn, N.G.: A combinatorial problem. Proc. Akad. Wet. Amsterdam 49, 758\u2013764 (1946)","journal-title":"Proc. Akad. Wet. Amsterdam"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"DJ Cook","year":"1994","unstructured":"Cook, D.J., Holder, L.B.: Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res. 1, 231\u2013255 (1994)","journal-title":"J. Artif. Intell. Res."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Das, S., Chakravarthy, S.: Partition and conquer: map\/reduce way of substructure discovery. In: International Conference on Big Data Analytics and Knowledge Discovery, pp. 365\u2013378. Springer (2015)","DOI":"10.1007\/978-3-319-22729-0_28"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"De Domenico, M., Sol\u00e9-Ribalta, A., G\u00f3mez, S., Arenas, A.: Navigability of interconnected networks under random failures. In: Proceedings of the National Academy of Sciences (2014)","DOI":"10.1073\/pnas.1318469111"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Deshpande, M., Kuramochi, M., Karypis, G.: Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds. In: IEEE International Conference on Data Mining, pp. 35\u201342 (2003). https:\/\/doi.org\/10.1109\/ICDM.2003.1250900","DOI":"10.1109\/ICDM.2003.1250900"},{"key":"14_CR13","unstructured":"Domenico, M.D., Nicosia, V., Arenas, A., Latora, V.: Layer aggregation and reducibility of multilayer interconnected networks. CoRR abs\/1405.0425 (2014)"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1093\/comnet\/cnu016","volume":"2","author":"M Kivel\u00e4","year":"2014","unstructured":"Kivel\u00e4, M., et al.: Multilayer networks. J. Complex Netw. 2(3), 203\u2013271 (2014)","journal-title":"J. Complex Netw."},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Liu, Y., Jiang, X., Chen, H., Ma, J., Zhang, X.: MapReduce-Based pattern finding algorithm applied in motif detection for prescription compatibility network. In: Advanced Parallel Programming Technologies, pp. 341\u2013355 (2009)","DOI":"10.1007\/978-3-642-03644-6_27"},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-021-00443-9","volume":"8","author":"ME Coimbra","year":"2021","unstructured":"Coimbra, M.E., Francisco, A.P., Veiga, L.: An analysis of the graph processing landscape. J. Big Data 8(1), 1\u201341 (2021). https:\/\/doi.org\/10.1186\/s40537-021-00443-9","journal-title":"J. Big Data"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Padmanabhan, S., Chakravarthy, S.: HDB-Subdue: a scalable approach to graph mining. In: DaWaK, pp. 325\u2013338 (2009)","DOI":"10.1007\/978-3-642-03730-6_26"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Pei, J., et al.: PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth. In: ICDE, pp. 215\u2013224 (2001). https:\/\/doi.org\/10.1109\/ICDE.2001.914830","DOI":"10.1109\/ICDE.2001.914830"},{"issue":"2","key":"14_CR19","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1214\/aos\/1176346150","volume":"11","author":"J Rissanen","year":"1983","unstructured":"Rissanen, J.: A universal prior for integers and estimation by minimum description length. Ann. Stat. 11(2), 416\u2013431 (1983)","journal-title":"Ann. Stat."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Santra, A., Bhowmick, S., Chakravarthy, S.: Efficient community re-creation in multilayer networks using Boolean operations. In: International Conf. on Computational Science, ICCS 2017 (2017)","DOI":"10.1016\/j.procs.2017.05.246"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Santra, A., Bhowmick, S., Chakravarthy, S.: Hubify: efficient estimation of central entities across multiplex layer compositions. In: IEEE International Conference on Data Mining Workshops, ICDM Workshops 2017 (2017)","DOI":"10.1109\/ICDMW.2017.24"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Santra, A., Irany, F.A., Madduri, K., Chakravarthy, S., Bhowmick, S.: Efficient community detection in multilayer networks using Boolean compositions. Front. Big Data 6 (2023)","DOI":"10.3389\/fdata.2023.1144793"},{"key":"14_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2022.102058","volume":"141","author":"A Santra","year":"2022","unstructured":"Santra, A., Komar, K.S., Bhowmick, S., Chakravarthy, S.: From base data to knowledge discovery - a life cycle approach - using multilayer networks. Data Knowl. Eng. 141, 102058 (2022)","journal-title":"Data Knowl. Eng."},{"key":"14_CR24","unstructured":"Singh, A., Santra, A., Chakravarthy, S.: Scalable substructure discovery algorithm for homogeneous multilayer networks. arXiv preprint arXiv:2504.19328 (2025)"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: World Wide Web Conference Series. pp. 607\u2013614 (2011). https:\/\/doi.org\/10.1145\/1963405.1963491","DOI":"10.1145\/1963405.1963491"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Wasserman, S., Faust, K.: Social network analysis: methods and applications (1994)","DOI":"10.1017\/CBO9780511815478"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Yang, S., Yan, X., Zong, B., Khan, A.: Towards effective partition management for large graphs. In: SIGMOD Conference, pp. 517\u2013528 (2012)","DOI":"10.1145\/2213836.2213895"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05281-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T03:45:46Z","timestamp":1776743146000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05281-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,18]]},"ISBN":["9783032052803","9783032052810"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05281-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,18]]},"assertion":[{"value":"18 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADBIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Advances in Databases and Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tampere","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adbis2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adbis2025.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}