{"id":"https://openalex.org/W4361003144","doi":"https://doi.org/10.3390/computation11040069","title":"The Multi-Maximum and Quasi-Maximum Common Subgraph Problem","display_name":"The Multi-Maximum and Quasi-Maximum Common Subgraph Problem","publication_year":2023,"publication_date":"2023-03-27","ids":{"openalex":"https://openalex.org/W4361003144","doi":"https://doi.org/10.3390/computation11040069"},"language":"en","primary_location":{"id":"doi:10.3390/computation11040069","is_oa":true,"landing_page_url":"https://doi.org/10.3390/computation11040069","pdf_url":"https://www.mdpi.com/2079-3197/11/4/69/pdf?version=1679913464","source":{"id":"https://openalex.org/S2738402919","display_name":"Computation","issn_l":"2079-3197","issn":["2079-3197"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/2079-3197/11/4/69/pdf?version=1679913464","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":["Dipartimento di Automatica e Informatica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy"],"raw_orcid":"https://orcid.org/0009-0008-7553-4839","affiliations":[{"raw_affiliation_string":"Dipartimento di Automatica e Informatica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 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":["Dipartimento di Automatica e Informatica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy"],"raw_orcid":"https://orcid.org/0000-0001-6835-8277","affiliations":[{"raw_affiliation_string":"Dipartimento di Automatica e Informatica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023997315","https://openalex.org/A5032827585"],"corresponding_institution_ids":["https://openalex.org/I177477856"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.5887,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.67293989,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"11","issue":"4","first_page":"69","last_page":"69"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994000196456909,"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.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.744229793548584},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6713013648986816},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6013871431350708},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5945746898651123},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5295261740684509},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5075758695602417},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4905973970890045},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.47797390818595886},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4411994218826294},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4335521161556244},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.42661434412002563},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.416909784078598},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32696110010147095},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3227742314338684},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24356865882873535},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.23503434658050537},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10418927669525146},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08291932940483093}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.744229793548584},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6713013648986816},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6013871431350708},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5945746898651123},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5295261740684509},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5075758695602417},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4905973970890045},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.47797390818595886},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4411994218826294},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4335521161556244},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.42661434412002563},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.416909784078598},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32696110010147095},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3227742314338684},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24356865882873535},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.23503434658050537},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10418927669525146},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08291932940483093},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/computation11040069","is_oa":true,"landing_page_url":"https://doi.org/10.3390/computation11040069","pdf_url":"https://www.mdpi.com/2079-3197/11/4/69/pdf?version=1679913464","source":{"id":"https://openalex.org/S2738402919","display_name":"Computation","issn_l":"2079-3197","issn":["2079-3197"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computation","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:d54715d3155b430d9927739cfa80dbc7","is_oa":true,"landing_page_url":"https://doaj.org/article/d54715d3155b430d9927739cfa80dbc7","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computation, Vol 11, Iss 4, p 69 (2023)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/2079-3197/11/4/69/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/computation11040069","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computation; Volume 11; Issue 4; Pages: 69","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/computation11040069","is_oa":true,"landing_page_url":"https://doi.org/10.3390/computation11040069","pdf_url":"https://www.mdpi.com/2079-3197/11/4/69/pdf?version=1679913464","source":{"id":"https://openalex.org/S2738402919","display_name":"Computation","issn_l":"2079-3197","issn":["2079-3197"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4361003144.pdf"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1969153299","https://openalex.org/W1974032838","https://openalex.org/W1996615424","https://openalex.org/W2001431291","https://openalex.org/W2002470750","https://openalex.org/W2014436490","https://openalex.org/W2024578140","https://openalex.org/W2033857234","https://openalex.org/W2043005464","https://openalex.org/W2068379792","https://openalex.org/W2082403159","https://openalex.org/W2103626206","https://openalex.org/W2109294083","https://openalex.org/W2116007667","https://openalex.org/W2135445920","https://openalex.org/W2138621811","https://openalex.org/W2153747625","https://openalex.org/W2604114816","https://openalex.org/W2738645295","https://openalex.org/W2966915742","https://openalex.org/W2994911615","https://openalex.org/W2998336143","https://openalex.org/W3106926726","https://openalex.org/W3170592856","https://openalex.org/W4233991634","https://openalex.org/W4237705776","https://openalex.org/W6634264458","https://openalex.org/W6732661957","https://openalex.org/W6772119740"],"related_works":["https://openalex.org/W112744582","https://openalex.org/W1800827217","https://openalex.org/W3128179121","https://openalex.org/W1486100501","https://openalex.org/W2154893658","https://openalex.org/W1494791230","https://openalex.org/W2044459301","https://openalex.org/W2135709899","https://openalex.org/W1501886372","https://openalex.org/W2116486117"],"abstract_inverted_index":{"The":[0],"Maximum":[1,40],"Common":[2,41],"Subgraph":[3,42],"problem":[4],"has":[5,12],"been":[6],"long":[7],"proven":[8],"NP-hard.":[9],"Nevertheless,":[10],"it":[11],"countless":[13],"practical":[14],"applications,":[15],"and":[16,24,34,78,98,125,144,198,245],"researchers":[17],"are":[18,165,195,212],"still":[19],"searching":[20],"for":[21,76,90,221],"exact":[22,88,171,193],"solutions":[23,194],"scalable":[25],"heuristic":[26],"approaches.":[27],"Driven":[28],"by":[29,173,181],"applications":[30],"in":[31,203,242],"molecular":[32],"science":[33],"cyber-security,":[35],"we":[36,72,79,164],"concentrate":[37],"on":[38,57,156,258],"the":[39,65,87,109,114,118,122,127,139,142,145,170,178,208,222,250,256],"among":[43,111],"an":[44],"indefinite":[45],"number":[46],"of":[47,69,83,117,141,187,199,225,240,249,255],"graphs.":[48,62,92],"We":[49,93,131,148],"first":[50],"extend":[51],"a":[52,81,153,174,200,219,228],"state-of-the-art":[53,154],"branch-and-bound":[54],"procedure":[55],"working":[56],"two":[58,190],"graphs":[59,143,146],"to":[60,85,107,137,167,237],"N":[61,91],"Then,":[63],"given":[64],"high":[66],"computational":[67],"cost":[68],"this":[70],"approach,":[71],"trade":[73],"off":[74],"complexity":[75,232],"accuracy,":[77],"propose":[80],"set":[82],"heuristics":[84,136,211],"approximate":[86],"solution":[89,252],"analyze":[94],"sequential,":[95],"parallel":[96],"multi-core,":[97],"parallel-many":[99],"core":[100],"(GPU-based)":[101],"approaches,":[102],"exploiting":[103],"several":[104,134,238],"leveraging":[105],"techniques":[106],"decrease":[108],"contention":[110],"threads,":[112],"improve":[113],"workload":[115],"balance":[116],"different":[119],"tasks,":[120],"reduce":[121],"computation":[123,172],"time,":[124],"increase":[126],"final":[128],"result":[129],"size.":[130],"also":[132],"present":[133],"sorting":[135],"order":[138],"vertices":[140],"themselves.":[147],"compare":[149],"our":[150,210,243],"algorithms":[151],"with":[152,253],"method":[155],"publicly":[157],"available":[158],"benchmark":[159],"sets.":[160],"On":[161,185,207],"graph":[162],"pairs,":[163],"able":[166],"speed":[168,223,234],"up":[169,224,236],"2\u00d7":[175],"factor,":[176],"pruning":[177],"search":[179],"space":[180],"more":[182,188],"than":[183,189],"60%.":[184],"sets":[186],"graphs,":[191],"all":[192],"extremely":[196],"time-consuming":[197],"complex":[201],"application":[202],"many":[204],"real":[205],"cases.":[206],"contrary,":[209],"far":[213,229],"less":[214],"expensive":[215],"(as":[216],"they":[217],"show":[218],"lower-bound":[220],"10\u00d7),":[226],"have":[227],"better":[230],"asymptotic":[231],"(with":[233],"ups":[235],"orders":[239],"magnitude":[241],"experiments),":[244],"obtain":[246],"excellent":[247],"approximations":[248],"maximal":[251],"98.5%":[254],"nodes":[257],"average.":[259]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":1}],"updated_date":"2026-01-23T23:20:30.427331","created_date":"2025-10-10T00:00:00"}