{"id":"https://openalex.org/W4416868583","doi":"https://doi.org/10.1007/s10732-025-09575-0","title":"Improving state-of-the-art vertex sorting algorithms to compute the maximum common induced subgraph","display_name":"Improving state-of-the-art vertex sorting algorithms to compute the maximum common induced subgraph","publication_year":2025,"publication_date":"2025-12-01","ids":{"openalex":"https://openalex.org/W4416868583","doi":"https://doi.org/10.1007/s10732-025-09575-0"},"language":"en","primary_location":{"id":"doi:10.1007/s10732-025-09575-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10732-025-09575-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10732-025-09575-0.pdf","source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10732-025-09575-0.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032411827","display_name":"Andrea Calabrese","orcid":"https://orcid.org/0000-0002-8854-8171"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Andrea Calabrese","raw_affiliation_strings":["DAUIN - Dipartimento di Automatica e Informatica, Politecnico di Torino, Torino, Italy"],"raw_orcid":"https://orcid.org/0000-0002-8854-8171","affiliations":[{"raw_affiliation_string":"DAUIN - Dipartimento di Automatica e Informatica, Politecnico di Torino, Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032827585","display_name":"Lorenzo Cardone","orcid":"https://orcid.org/0009-0008-7553-4839"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Lorenzo Cardone","raw_affiliation_strings":["DAUIN - Dipartimento di Automatica e Informatica, Politecnico di Torino, Torino, Italy"],"raw_orcid":"https://orcid.org/0009-0008-7553-4839","affiliations":[{"raw_affiliation_string":"DAUIN - Dipartimento di Automatica e Informatica, Politecnico di Torino, Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081090430","display_name":"Salvatore J. Licata","orcid":"https://orcid.org/0009-0002-7646-0225"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Salvatore Licata","raw_affiliation_strings":["DAUIN - Dipartimento di Automatica e Informatica, Politecnico di Torino, Torino, Italy"],"raw_orcid":"https://orcid.org/0009-0002-7646-0225","affiliations":[{"raw_affiliation_string":"DAUIN - Dipartimento di Automatica e Informatica, Politecnico di Torino, Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102534663","display_name":"Marco Porro","orcid":"https://orcid.org/0009-0002-1428-7818"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Marco Porro","raw_affiliation_strings":["DAUIN - Dipartimento di Automatica e Informatica, Politecnico di Torino, Torino, Italy"],"raw_orcid":"https://orcid.org/0009-0002-1428-7818","affiliations":[{"raw_affiliation_string":"DAUIN - Dipartimento di Automatica e Informatica, Politecnico di Torino, Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023997315","display_name":"Stefano Quer","orcid":"https://orcid.org/0000-0001-6835-8277"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Stefano Quer","raw_affiliation_strings":["DAUIN - Dipartimento di Automatica e Informatica, Politecnico di Torino, Torino, Italy"],"raw_orcid":"https://orcid.org/0000-0001-6835-8277","affiliations":[{"raw_affiliation_string":"DAUIN - Dipartimento di Automatica e Informatica, Politecnico di Torino, Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023997315","https://openalex.org/A5032411827","https://openalex.org/A5032827585","https://openalex.org/A5081090430","https://openalex.org/A5102534663"],"corresponding_institution_ids":["https://openalex.org/I177477856"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28298269,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.6875,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.6875,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.030899999663233757,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.029500000178813934,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6162999868392944},{"id":"https://openalex.org/keywords/betweenness-centrality","display_name":"Betweenness centrality","score":0.5613999962806702},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5354999899864197},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5289999842643738},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.4672999978065491},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.42080000042915344},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4124000072479248},{"id":"https://openalex.org/keywords/pagerank","display_name":"PageRank","score":0.38359999656677246},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.3727000057697296},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.3714999854564667}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6162999868392944},{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.5613999962806702},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5354999899864197},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5289999842643738},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4943000078201294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4779999852180481},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.4672999978065491},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44859999418258667},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43059998750686646},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.42080000042915344},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4124000072479248},{"id":"https://openalex.org/C2779172887","wikidata":"https://www.wikidata.org/wiki/Q184316","display_name":"PageRank","level":2,"score":0.38359999656677246},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3727000057697296},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3714999854564667},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.3553999960422516},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C2779545769","wikidata":"https://www.wikidata.org/wiki/Q5135364","display_name":"Closeness","level":2,"score":0.34549999237060547},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.31769999861717224},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.3167000114917755},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.3075999915599823},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3052999973297119},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.29510000348091125},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.29120001196861267},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.28790000081062317},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28139999508857727},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.2745000123977661},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.2700999975204468},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.26600000262260437},{"id":"https://openalex.org/C64540648","wikidata":"https://www.wikidata.org/wiki/Q646477","display_name":"Sorting network","level":4,"score":0.262800008058548},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.25600001215934753},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2540999948978424},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.25290000438690186},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2524999976158142}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10732-025-09575-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10732-025-09575-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10732-025-09575-0.pdf","source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10732-025-09575-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10732-025-09575-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10732-025-09575-0.pdf","source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320313985","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416868583.pdf","grobid_xml":"https://content.openalex.org/works/W4416868583.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1861597632","https://openalex.org/W1971937094","https://openalex.org/W2018099718","https://openalex.org/W2025844353","https://openalex.org/W2026417691","https://openalex.org/W2033857234","https://openalex.org/W2066636486","https://openalex.org/W2068379792","https://openalex.org/W2082403159","https://openalex.org/W2112090702","https://openalex.org/W2116007667","https://openalex.org/W2124545752","https://openalex.org/W2153747625","https://openalex.org/W2423531333","https://openalex.org/W2966915742","https://openalex.org/W2998336143","https://openalex.org/W4226092330","https://openalex.org/W4237705776","https://openalex.org/W4280565832","https://openalex.org/W4312794515","https://openalex.org/W4361003144","https://openalex.org/W4384210225"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"The":[1,52,89],"Maximum":[2],"Common":[3],"Induced":[4],"Subgraph":[5],"problem":[6],"is":[7,57,100],"a":[8,42,73,94,115,135],"longstanding":[9],"challenge":[10],"in":[11],"graph":[12,211],"theory":[13],"and":[14,21,28,38,134,154,166,192,200,214],"combinatorial":[15],"optimization,":[16],"recognized":[17],"for":[18,82],"being":[19],"NP-complete":[20],"its":[22,39],"applications":[23],"across":[24,182],"chemistry,":[25],"network":[26],"analysis,":[27],"pattern":[29],"recognition.":[30],"State-of-the-art":[31],"methods,":[32],"such":[33,189],"as":[34,190],"the":[35,48,61,70,79,83,107,140,163,168,208],"McSplit":[36],"algorithm":[37,71,91],"successors,":[40],"employ":[41],"recursive":[43],"branch-and-bound":[44,215],"procedure":[45],"to":[46,171],"navigate":[47],"vast":[49],"solution":[50,75],"space.":[51],"efficiency":[53],"of":[54,87,109,118],"this":[55],"search":[56,80,165],"critically":[58],"dependent":[59],"on":[60,93,113,147],"initial":[62],"vertex":[63],"sorting":[64],"heuristic,":[65,98],"which":[66,99],"not":[67],"only":[68],"guides":[69],"toward":[72],"good":[74],"but":[76],"also":[77,158],"structures":[78],"tree":[81],"computationally":[84],"intensive":[85],"proof":[86],"optimality.":[88],"original":[90],"relies":[92],"simple":[95],"node":[96],"degree":[97],"often":[101],"suboptimal.":[102],"This":[103],"paper":[104],"systematically":[105],"investigates":[106],"influence":[108],"alternative":[110],"vertex-ordering":[111],"heuristics":[112,124],"McSplitDAL,":[114],"state-of-the-art":[116],"variant":[117],"McSplit.":[119],"We":[120,143,157],"integrate":[121],"five":[122],"node-ranking":[123],"(namely,":[125],"PageRank,":[126],"Betweenness":[127],"Centrality,":[128,130,194],"Closeness":[129],"Local":[131],"Clustering":[132],"Coefficient,":[133],"modified":[136],"Katz":[137,193],"Centrality)":[138],"into":[139,207],"McSplitDAL":[141],"framework.":[142],"analyze":[144],"their":[145],"effect":[146],"search-space":[148],"exploration,":[149],"pruning":[150,199],"efficiency,":[151],"convergence":[152],"behavior,":[153],"execution":[155],"speed.":[156],"investigate":[159],"how":[160],"they":[161],"shape":[162],"algorithmic":[164],"affect":[167],"solver\u2019s":[169],"ability":[170],"approach":[172],"or":[173],"prove":[174],"optimality":[175],"under":[176],"constrained":[177],"computational":[178],"budgets.":[179],"Experimental":[180],"results":[181],"heterogeneous":[183],"datasets":[184],"reveal":[185],"that":[186],"specific":[187],"heuristics,":[188],"PageRank":[191],"consistently":[195],"promote":[196],"more":[197],"effective":[198],"higher-quality":[201],"intermediate":[202],"solutions,":[203],"offering":[204],"valuable":[205],"insights":[206],"relationship":[209],"between":[210],"topology-derived":[212],"measures":[213],"performance.":[216]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-12-01T00:00:00"}