{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T13:12:41Z","timestamp":1763644361091,"version":"3.37.3"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T00:00:00Z","timestamp":1722988800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T00:00:00Z","timestamp":1722988800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004770","name":"Universit\u00e0 degli Studi di Parma","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004770","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Consider a large labeled graph (network), denoted the <jats:italic>target<\/jats:italic>. Subgraph matching is the problem of finding all instances of a small subgraph, denoted the <jats:italic>query<\/jats:italic>, in the target graph. Unlike the majority of existing methods that are restricted to graphs with labels solely on vertices, our proposed approach, named can effectively handle graphs with labels on both vertices and edges. ntroduces an efficient new vertex\/edge domain data structure filtering procedure to speed up subgraph queries. The procedure, called path-based reduction, filters initial domains by scanning them for paths up to a specified length that appear in the query graph. Additionally, ncorporates existing techniques like variable ordering and parent selection, as well as adapting the core search process, to take advantage of the information within edge domains. Experiments in real scenarios such as protein\u2013protein interaction graphs, co-authorship networks, and email networks, show that s faster than state-of-the-art systems varying the number of distinct vertex labels over the whole target graph and query sizes.<\/jats:p>","DOI":"10.1007\/s10618-024-01061-8","type":"journal-article","created":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T20:34:13Z","timestamp":1723062853000},"page":"3868-3921","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["ArcMatch: high-performance subgraph matching for labeled graphs by exploiting edge domains"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1637-7545","authenticated-orcid":false,"given":"Vincenzo","family":"Bonnici","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Grasso","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Micale","sequence":"additional","affiliation":[]},{"given":"Antonio di","family":"Maria","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Shasha","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Pulvirenti","sequence":"additional","affiliation":[]},{"given":"Rosalba","family":"Giugno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,7]]},"reference":[{"issue":"1","key":"1061_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s12539-019-00323-0","volume":"11","author":"A Aparo","year":"2019","unstructured":"Aparo A, Bonnici V, Micale G, Ferro A, Shasha D, Pulvirenti A, Giugno R (2019) Fast subgraph matching strategies based on pattern-only heuristics. Interdiscip. Sci.: Comput. Life Sci. 11(1):21\u201332","journal-title":"Interdiscip. Sci.: Comput. Life Sci."},{"key":"1061_CR2","unstructured":"Archibald B, Burns K, McCreesh C, Sevegnani M (2021) Practical bigraphs via subgraph isomorphism. In: 27th international conference on principles and practice of constraint programming (CP 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik"},{"key":"1061_CR3","doi-asserted-by":"crossref","unstructured":"Avellaneda F, Alikacem E-H, Jaafar F (2019) Using attack pattern for cyber attack attribution. In: 2019 International conference on cybersecurity (ICoCSec). IEEE, pp 1\u20136","DOI":"10.1109\/ICoCSec47621.2019.8970906"},{"issue":"3","key":"1061_CR4","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1021\/ci00047a033","volume":"25","author":"AT Balaban","year":"1985","unstructured":"Balaban AT (1985) Applications of graph theory in chemistry. J Chem Inf Comput Sci 25(3):334\u2013343","journal-title":"J Chem Inf Comput Sci"},{"issue":"5439","key":"1061_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. science 286(5439):509\u2013512","journal-title":"science"},{"key":"1061_CR6","doi-asserted-by":"crossref","unstructured":"Bi F, Chang L, Lin X, Qin L, Zhang W (2016) Efficient subgraph matching by postponing cartesian products. In: Proceedings of the 2016 international conference on management of data, pp 1199\u20131214","DOI":"10.1145\/2882903.2915236"},{"issue":"8","key":"1061_CR7","doi-asserted-by":"publisher","first-page":"8003","DOI":"10.1007\/s10462-022-10375-2","volume":"56","author":"R Bing","year":"2023","unstructured":"Bing R, Yuan G, Zhu M, Meng F, Ma H, Qiao S (2023) Heterogeneous graph neural networks analysis: a survey of techniques, evaluations and applications. Artif Intell Rev 56(8):8003\u20138042","journal-title":"Artif Intell Rev"},{"issue":"1","key":"1061_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TCBB.2016.2515595","volume":"14","author":"V Bonnici","year":"2017","unstructured":"Bonnici V, Giugno R (2017) On the variable ordering in subgraph isomorphism algorithms. IEEE\/ACM Trans Comput Biol Bioinform 14(1):193\u2013203","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"1061_CR9","doi-asserted-by":"crossref","unstructured":"Bonnici V, Ferro A, Giugno R, Pulvirenti A, Shasha D (2010) Enhancing graph database indexing by suffix tree structure. In: IAPR international conference on pattern recognition in bioinformatics. Springer, Berlin, pp 195\u2013203","DOI":"10.1007\/978-3-642-16001-1_17"},{"issue":"7","key":"1061_CR10","first-page":"1","volume":"14","author":"V Bonnici","year":"2013","unstructured":"Bonnici V, Giugno R, Pulvirenti A, Shasha D, Ferro A (2013) A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform 14(7):1\u201313","journal-title":"BMC Bioinform"},{"key":"1061_CR11","doi-asserted-by":"crossref","unstructured":"Cao J, Hall D (2021) Module library development via graph mining. In: Proceedings of the 2021 European conference on computing in construction. University College Dublin, Dublin, pp 285\u2013292","DOI":"10.35490\/EC3.2021.151"},{"key":"1061_CR12","doi-asserted-by":"crossref","unstructured":"Carletti V, Foggia P, Vento M (2013) Performance comparison of five exact graph matching algorithms on biological databases. In: International conference on image analysis and processing. Springer, Berlin, pp 409\u2013417","DOI":"10.1007\/978-3-642-41190-8_44"},{"key":"1061_CR13","doi-asserted-by":"crossref","unstructured":"Carletti V, Foggia P, Saggese A, Vento M (2017a) Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with vf3. IEEE Trans Pattern Anal Mach Intell 40(4):804\u2013818","DOI":"10.1109\/TPAMI.2017.2696940"},{"key":"1061_CR14","doi-asserted-by":"crossref","unstructured":"Carletti V, Foggia P, Saggese A, Vento M (2017b) Introducing vf3: a new algorithm for subgraph isomorphism. In: International workshop on graph-based representations in pattern recognition. Springer, Berlin, pp 128\u2013139","DOI":"10.1007\/978-3-319-58961-9_12"},{"key":"1061_CR15","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.patrec.2018.06.025","volume":"134","author":"V Carletti","year":"2020","unstructured":"Carletti V, Foggia P, Greco A, Saggese A, Vento M (2020) Comparing performance of graph matching algorithms on huge graphs. Pattern Recogn Lett 134:58\u201367","journal-title":"Pattern Recogn Lett"},{"key":"1061_CR16","doi-asserted-by":"crossref","unstructured":"Chaturvedi A, Gupta M, Gupta SK (2018) DPVO: design pattern detection using vertex ordering a case study in jhotdraw with documentation to improve reusability. In: International conference on communication, networks and computing. Springer, Berlin, pp 452\u2013465","DOI":"10.1007\/978-981-13-2372-0_40"},{"issue":"1","key":"1061_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-021-26165-3","volume":"12","author":"NM Clark","year":"2021","unstructured":"Clark NM, Nolan TM, Wang P, Song G, Montes C, Valentine CT, Guo H, Sozzani R, Yin Y, Walley JW (2021) Integrated omics networks reveal the temporal signaling events of brassinosteroid response in Arabidopsis. Nat Commun 12(1):1\u201313","journal-title":"Nat Commun"},{"key":"1061_CR18","doi-asserted-by":"crossref","unstructured":"Comyn-Wattiau I, Akoka J (2017) Model driven reverse engineering of NoSQL property graph databases: the case of Neo4j. In: 2017 IEEE international conference on big data (big data). IEEE, pp 453\u2013458","DOI":"10.1109\/BigData.2017.8257957"},{"key":"1061_CR19","doi-asserted-by":"crossref","unstructured":"Cook SA (1971) The complexity of theorem-proving procedures. In: Proceedings of the third annual ACM symposium on theory of computing, pp 151\u2013158","DOI":"10.1145\/800157.805047"},{"key":"1061_CR20","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2001) An improved algorithm for matching large graphs. In: 3rd IAPR-TC15 workshop on graph-based representations in pattern recognition, pp 149\u2013159"},{"issue":"2","key":"1061_CR21","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.patcog.2014.05.018","volume":"48","author":"N Dahm","year":"2015","unstructured":"Dahm N, Bunke H, Caelli T, Gao Y (2015) Efficient subgraph matching using topological node feature constraints. Pattern Recogn 48(2):317\u2013330","journal-title":"Pattern Recogn"},{"key":"1061_CR22","volume-title":"Constraint processing","author":"R Dechter","year":"2003","unstructured":"Dechter R, Cohen D et al (2003) Constraint processing. Morgan Kaufmann, San Francisco"},{"key":"1061_CR23","first-page":"290","volume":"6","author":"P Erdos","year":"1959","unstructured":"Erdos P, R\u00e9nyi A (1959) On random graph. Publ Math 6:290\u2013297","journal-title":"Publ Math"},{"issue":"10","key":"1061_CR24","doi-asserted-by":"publisher","first-page":"76911","DOI":"10.1371\/journal.pone.0076911","volume":"8","author":"R Giugno","year":"2013","unstructured":"Giugno R, Bonnici V, Bombieri N, Pulvirenti A, Ferro A, Shasha D (2013) Grapes: a software for parallel searching on biological graphs targeting multi-core architectures. PLoS ONE 8(10):76911","journal-title":"PLoS ONE"},{"key":"1061_CR25","doi-asserted-by":"crossref","unstructured":"Han W-S, Pham M-D, Lee J, Kasperovics R, Yu JX (2011) igraph in action: performance analysis of disk-based graph indexing techniques. In: Proceedings of the 2011 ACM SIGMOD international conference on management of data, pp 1241\u20131242","DOI":"10.1145\/1989323.1989464"},{"key":"1061_CR26","unstructured":"Han W-S, Lee J, Lee J-H (2013) Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data, pp 337\u2013348"},{"key":"1061_CR27","doi-asserted-by":"crossref","unstructured":"Han M, Kim H, Gu G, Park K, Han W-S (2019) Efficient subgraph matching: harmonizing dynamic programming, adaptive matching order, and failing set together. In: Proceedings of the 2019 international conference on management of data, pp 1429\u20131446","DOI":"10.1145\/3299869.3319880"},{"issue":"3","key":"1061_CR28","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"RM Haralick","year":"1980","unstructured":"Haralick RM, Elliott GL (1980) Increasing tree search efficiency for constraint satisfaction problems. Artif Intell 14(3):263\u2013313","journal-title":"Artif Intell"},{"key":"1061_CR29","doi-asserted-by":"crossref","unstructured":"He H, Singh AK (2008) Graphs-at-a-time: query language and access methods for graph databases. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, pp 405\u2013418","DOI":"10.1145\/1376616.1376660"},{"key":"1061_CR30","doi-asserted-by":"crossref","unstructured":"Hoksza D, Jel\u00ednek J (2015) Using neo4j for mining protein graphs: a case study. In: 2015 26th international workshop on database and expert systems applications (DEXA). IEEE, pp 230\u2013234","DOI":"10.1109\/DEXA.2015.59"},{"key":"1061_CR31","doi-asserted-by":"publisher","first-page":"13137","DOI":"10.7717\/peerj.13137","volume":"10","author":"C-H Huang","year":"2022","unstructured":"Huang C-H, Zaenudin E, Tsai JJ, Kurubanjerdjit N, Ng K-L (2022) Network subgraph-based approach for analyzing and comparing molecular networks. PeerJ 10:13137","journal-title":"PeerJ"},{"key":"1061_CR32","doi-asserted-by":"crossref","unstructured":"Katari MS, Tyagi S, Shasha D (2021) Statistics is easy: case studies on real scientific datasets. Synthesis lectures on mathematics and statistics, vol 13, no 3. Springer, Berlin, pp 1\u201374","DOI":"10.2200\/S01078ED1V01Y202102MAS039"},{"issue":"12","key":"1061_CR33","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.14778\/2824032.2824054","volume":"8","author":"F Katsarou","year":"2015","unstructured":"Katsarou F, Ntarmos N, Triantafillou P (2015) Performance and scalability of indexed subgraph query processing methods. Proc VLDB Endow 8(12):1566\u20131577","journal-title":"Proc VLDB Endow"},{"key":"1061_CR34","doi-asserted-by":"crossref","unstructured":"Katsarou F, Ntarmos N, Triantafillou P (2017) Hybrid algorithms for subgraph pattern queries in graph databases. In: 2017 IEEE international conference on big data (big data). IEEE, pp 656\u2013665","DOI":"10.1109\/BigData.2017.8257981"},{"key":"1061_CR35","doi-asserted-by":"crossref","unstructured":"Kim H, Choi Y, Park K, Lin X, Hong S-H, Han W-S (2021) Versatile equivalences: speeding up subgraph query processing and subgraph matching. In: Proceedings of the 2021 international conference on management of data, pp 925\u2013937","DOI":"10.1145\/3448016.3457265"},{"key":"1061_CR36","first-page":"1","volume":"32","author":"H Kim","year":"2022","unstructured":"Kim H, Choi Y, Park K, Lin X, Hong S-H, Han W-S (2022) Fast subgraph query processing and subgraph matching via static and dynamic equivalences. VLDB J 32:1\u201326","journal-title":"VLDB J"},{"issue":"2","key":"1061_CR37","doi-asserted-by":"publisher","first-page":"133","DOI":"10.14778\/2535568.2448946","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee J, Han W-S, Kasperovics R, Lee J-H (2012) An in-depth comparison of subgraph isomorphism algorithms in graph databases. Proc VLDB Endow 6(2):133\u2013144","journal-title":"Proc VLDB Endow"},{"key":"1061_CR38","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining, pp 177\u2013187","DOI":"10.1145\/1081870.1081893"},{"issue":"1","key":"1061_CR39","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"AK Mackworth","year":"1977","unstructured":"Mackworth AK (1977) Consistency in networks of relations. Artif Intell 8(1):99\u2013118","journal-title":"Artif Intell"},{"key":"1061_CR40","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1613\/jair.5768","volume":"61","author":"C McCreesh","year":"2018","unstructured":"McCreesh C, Prosser P, Solnon C, Trimble J (2018) When subgraph isomorphism is really hard, and why this matters for graph databases. J Artif Intell Res 61:723\u2013759","journal-title":"J Artif Intell Res"},{"key":"1061_CR41","doi-asserted-by":"crossref","unstructured":"McCreesh C, Prosser P, Trimble J (2020) The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants. In: International conference on graph transformation. Springer, Berlin, pp 316\u2013324","DOI":"10.1007\/978-3-030-51372-6_19"},{"issue":"5594","key":"1061_CR42","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298(5594):824\u2013827","journal-title":"Science"},{"key":"1061_CR43","doi-asserted-by":"publisher","first-page":"109254","DOI":"10.1016\/j.knosys.2022.109254","volume":"251","author":"M Petkovi\u0107","year":"2022","unstructured":"Petkovi\u0107 M, Ceci M, Pio G, \u0160krlj B, Kersting K, D\u017eeroski S (2022) Relational tree ensembles and feature rankings. Knowl-Based Syst 251:109254","journal-title":"Knowl-Based Syst"},{"issue":"5s","key":"1061_CR44","first-page":"1","volume":"16","author":"L Piccolboni","year":"2017","unstructured":"Piccolboni L, Menon A, Pravadelli G (2017) Efficient control-flow subgraph matching for detecting hardware trojans in RTL models. ACM Trans Embed Comput Syst (TECS) 16(5s):1\u201319","journal-title":"ACM Trans Embed Comput Syst (TECS)"},{"key":"1061_CR45","doi-asserted-by":"publisher","first-page":"113303","DOI":"10.1016\/j.dss.2020.113303","volume":"133","author":"T Pourhabibi","year":"2020","unstructured":"Pourhabibi T, Ong K-L, Kam BH, Boo YL (2020) Fraud detection: a systematic literature review of graph-based anomaly detection approaches. Decis Support Syst 133:113303","journal-title":"Decis Support Syst"},{"key":"1061_CR46","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1108\/17440081011053104","volume":"6","author":"S Sakr","year":"2010","unstructured":"Sakr S, Al-Naymat G (2010) Graph indexing and querying: a review. Int J Web Inf Syst 6:101\u2013120","journal-title":"Int J Web Inf Syst"},{"issue":"1","key":"1061_CR47","doi-asserted-by":"publisher","first-page":"364","DOI":"10.14778\/1453856.1453899","volume":"1","author":"H Shang","year":"2008","unstructured":"Shang H, Zhang Y, Lin X, Yu JX (2008) Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proc. VLDB Endow. 1(1):364\u2013375","journal-title":"Proc. VLDB Endow."},{"issue":"12\u201313","key":"1061_CR48","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.artint.2010.05.002","volume":"174","author":"C Solnon","year":"2010","unstructured":"Solnon C (2010) Alldifferent-based filtering for subgraph isomorphism. Artif Intell 174(12\u201313):850\u2013864","journal-title":"Artif Intell"},{"issue":"6","key":"1061_CR49","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1016\/j.cell.2005.08.029","volume":"122","author":"U Stelzl","year":"2005","unstructured":"Stelzl U, Worm U, Lalowski M, Haenig C, Brembeck FH, Goehler H, Stroedicke M, Zenkner M, Schoenherr A, Koeppen S et al (2005) A human protein\u2013protein interaction network: a resource for annotating the proteome. Cell 122(6):957\u2013968","journal-title":"Cell"},{"key":"1061_CR50","doi-asserted-by":"crossref","unstructured":"Strandberg PE, Ostrand TJ, Weyuker EJ, Sundmark D, Afzal W (2018) Automated test mapping and coverage for network topologies. In: Proceedings of the 27th ACM SIGSOFT international symposium on software testing and analysis, pp 73\u201383","DOI":"10.1145\/3213846.3213859"},{"key":"1061_CR51","doi-asserted-by":"crossref","unstructured":"Sun S, Luo Q (2020) In-memory subgraph matching: an in-depth study. In: Proceedings of the 2020 ACM SIGMOD international conference on management of data, pp 1083\u20131098","DOI":"10.1145\/3318464.3380581"},{"issue":"9","key":"1061_CR52","doi-asserted-by":"publisher","first-page":"788","DOI":"10.14778\/2311906.2311907","volume":"5","author":"Z Sun","year":"2012","unstructured":"Sun Z, Wang H, Wang H, Shao B, Li J (2012) Efficient subgraph matching on billion node graphs. Proc VLDB Endow 5(9):788\u2013799","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"1061_CR53","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM (JACM) 23(1):31\u201342","journal-title":"J ACM (JACM)"},{"key":"1061_CR54","first-page":"1","volume":"15","author":"JR Ullmann","year":"2011","unstructured":"Ullmann JR (2011) Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism. J. Exp. Algorithmics (JEA) 15:1\u20131","journal-title":"J. Exp. Algorithmics (JEA)"},{"key":"1061_CR55","doi-asserted-by":"crossref","unstructured":"Weich A, Flamann C, Berges J, Singh KP, Chambers D, Lai X, Wolkenhauer O, Berking C, Kroenke G, Gupta S et al (2024) The integration of network biology and pharmacophore modeling suggests repurposing clindamycin as an inhibitor of pyroptosis via caspase-1 blockage in tumor-associated macrophages. bioRxiv","DOI":"10.1101\/2024.01.18.576201"},{"issue":"1","key":"1061_CR56","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181\u2013213","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"1061_CR57","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10601-009-9074-3","volume":"15","author":"S Zampelli","year":"2010","unstructured":"Zampelli S, Deville Y, Solnon C (2010) Solving subgraph isomorphism problems with constraint programming. Constraints 15(3):327\u2013353","journal-title":"Constraints"},{"key":"1061_CR58","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.cad.2019.04.003","volume":"113","author":"L Zeng","year":"2019","unstructured":"Zeng L, Dong Z-K, Yu J-Y, Hong J, Wang H-Y (2019) Sketch-based retrieval and instantiation of parametric parts. Comput-Aided Des 113:82\u201395","journal-title":"Comput-Aided Des"},{"key":"1061_CR59","doi-asserted-by":"publisher","DOI":"10.1201\/9781315390628","volume-title":"Social networks with rich edge semantics","author":"Q Zheng","year":"2017","unstructured":"Zheng Q, Skillicorn D (2017) Social networks with rich edge semantics. Taylor & Francis, London"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-024-01061-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-024-01061-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-024-01061-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T09:11:23Z","timestamp":1730106683000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-024-01061-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,7]]},"references-count":59,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["1061"],"URL":"https:\/\/doi.org\/10.1007\/s10618-024-01061-8","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2024,8,7]]},"assertion":[{"value":"9 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}