{"id":"https://openalex.org/W2608355501","doi":"https://doi.org/10.1109/tpami.2017.2696940","title":"Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3","display_name":"Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3","publication_year":2017,"publication_date":"2017-04-24","ids":{"openalex":"https://openalex.org/W2608355501","doi":"https://doi.org/10.1109/tpami.2017.2696940","mag":"2608355501","pmid":"https://pubmed.ncbi.nlm.nih.gov/28436848"},"language":"en","primary_location":{"id":"doi:10.1109/tpami.2017.2696940","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpami.2017.2696940","pdf_url":null,"source":{"id":"https://openalex.org/S199944782","display_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","issn_l":"0162-8828","issn":["0162-8828","1939-3539","2160-9292"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043110356","display_name":"Vincenzo Carletti","orcid":"https://orcid.org/0000-0002-9130-5533"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Vincenzo Carletti","raw_affiliation_strings":["Department of Information and Electrical Engineering and Applied Mathematics, University of Salerno, Fisciano, SA, ITALY"],"affiliations":[{"raw_affiliation_string":"Department of Information and Electrical Engineering and Applied Mathematics, University of Salerno, Fisciano, SA, ITALY","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082731857","display_name":"Pasquale Foggia","orcid":"https://orcid.org/0000-0002-7096-1902"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Pasquale Foggia","raw_affiliation_strings":["Department of Information and Electrical Engineering and Applied Mathematics, University of Salerno, Fisciano, SA, ITALY"],"affiliations":[{"raw_affiliation_string":"Department of Information and Electrical Engineering and Applied Mathematics, University of Salerno, Fisciano, SA, ITALY","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083939361","display_name":"Alessia Saggese","orcid":"https://orcid.org/0000-0003-4687-7994"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alessia Saggese","raw_affiliation_strings":["Department of Information and Electrical Engineering and Applied Mathematics, University of Salerno, Fisciano, SA, ITALY"],"affiliations":[{"raw_affiliation_string":"Department of Information and Electrical Engineering and Applied Mathematics, University of Salerno, Fisciano, SA, ITALY","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027593663","display_name":"Mario Vento","orcid":"https://orcid.org/0000-0002-2948-741X"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Mario Vento","raw_affiliation_strings":["Department of Information and Electrical Engineering and Applied Mathematics, University of Salerno, Fisciano, SA, ITALY"],"affiliations":[{"raw_affiliation_string":"Department of Information and Electrical Engineering and Applied Mathematics, University of Salerno, Fisciano, SA, ITALY","institution_ids":["https://openalex.org/I131729948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5043110356"],"corresponding_institution_ids":["https://openalex.org/I131729948"],"apc_list":null,"apc_paid":null,"fwci":4.3473,"has_fulltext":false,"cited_by_count":167,"citation_normalized_percentile":{"value":0.96680443,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"40","issue":"4","first_page":"804","last_page":"818"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9929999709129333,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.7691130638122559},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7065514326095581},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.7043529748916626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6339960098266602},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5329500436782837},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4922608435153961},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4908810257911682},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.4607345759868622},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45894351601600647},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4394177198410034},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4301655888557434},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.41433268785476685},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34807339310646057},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30553096532821655},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26759225130081177},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.19901031255722046}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.7691130638122559},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7065514326095581},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.7043529748916626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6339960098266602},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5329500436782837},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4922608435153961},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4908810257911682},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.4607345759868622},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45894351601600647},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4394177198410034},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4301655888557434},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.41433268785476685},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34807339310646057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30553096532821655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26759225130081177},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.19901031255722046},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tpami.2017.2696940","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpami.2017.2696940","pdf_url":null,"source":{"id":"https://openalex.org/S199944782","display_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","issn_l":"0162-8828","issn":["0162-8828","1939-3539","2160-9292"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","raw_type":"journal-article"},{"id":"pmid:28436848","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/28436848","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE transactions on pattern analysis and machine intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W128561509","https://openalex.org/W135031542","https://openalex.org/W1517186914","https://openalex.org/W1974672137","https://openalex.org/W1976466396","https://openalex.org/W2003627696","https://openalex.org/W2010532254","https://openalex.org/W2012066443","https://openalex.org/W2022739485","https://openalex.org/W2027805278","https://openalex.org/W2035173902","https://openalex.org/W2046968552","https://openalex.org/W2046973707","https://openalex.org/W2064000859","https://openalex.org/W2070722739","https://openalex.org/W2096112029","https://openalex.org/W2100586946","https://openalex.org/W2109294083","https://openalex.org/W2126359798","https://openalex.org/W2140840007","https://openalex.org/W2143163611","https://openalex.org/W2143363350","https://openalex.org/W2143387021","https://openalex.org/W2147405597","https://openalex.org/W2147975091","https://openalex.org/W2152132697","https://openalex.org/W2152475379","https://openalex.org/W2163184742","https://openalex.org/W2167058518","https://openalex.org/W2170607286","https://openalex.org/W2345132433","https://openalex.org/W2487305562","https://openalex.org/W2531015590","https://openalex.org/W2557654849","https://openalex.org/W3106926726","https://openalex.org/W6605247924","https://openalex.org/W6605502080","https://openalex.org/W6666324004","https://openalex.org/W6786113189"],"related_works":["https://openalex.org/W1482551403","https://openalex.org/W2954463587","https://openalex.org/W2393701947","https://openalex.org/W2915540008","https://openalex.org/W2018568077","https://openalex.org/W2128390795","https://openalex.org/W1965191464","https://openalex.org/W231720905","https://openalex.org/W84561889","https://openalex.org/W167435155"],"abstract_inverted_index":{"Graph":[0],"matching":[1,30],"is":[2],"essential":[3],"in":[4,32,74,92],"several":[5],"fields":[6],"that":[7,42,143],"use":[8],"structured":[9],"information,":[10],"such":[11],"as":[12,48,50],"biology,":[13],"chemistry,":[14],"social":[15],"networks,":[16],"knowledge":[17],"management,":[18],"document":[19],"analysis":[20],"and":[21,57,84,96,128,155],"others.":[22],"Except":[23],"for":[24],"special":[25],"classes":[26],"of":[27,78,82,94,105,137],"graphs,":[28],"graph":[29],"has":[31,98,120,159],"the":[33,51,75,129,147,151],"worst-case":[34],"an":[35,44],"exponential":[36],"complexity;":[37],"however,":[38],"there":[39],"are":[40,53],"algorithms":[41,149],"show":[43],"acceptable":[45],"execution":[46],"time,":[47],"long":[49],"graphs":[52,79,108,152],"not":[54,58],"too":[55,59],"large":[56,103],"dense.":[60],"In":[61],"this":[62],"paper":[63],"we":[64],"introduce":[65],"a":[66,85,102,110,160],"novel":[67],"subgraph":[68],"isomorphism":[69],"algorithm,":[70],"VF3,":[71],"particularly":[72],"efficient":[73],"challenging":[76],"case":[77],"with":[80,109,123],"thousands":[81],"nodes":[83],"high":[86],"edge":[87],"density.":[88],"Its":[89],"performance,":[90],"both":[91],"terms":[93],"time":[95],"memory,":[97],"been":[99,121],"assessed":[100],"on":[101,164],"dataset":[104],"12,700":[106],"random":[107],"size":[111],"up":[112],"to":[113],"10,000":[114],"nodes,":[115],"made":[116],"publicly":[117],"available.":[118],"VF3":[119,144],"compared":[122],"four":[124],"other":[125,148],"state-of-the-art":[126],"algorithms,":[127],"huge":[130,154],"experimentation":[131],"required":[132],"more":[133],"than":[134],"two":[135],"years":[136],"processing":[138],"time.":[139],"The":[140],"results":[141],"confirm":[142],"definitely":[145],"outperforms":[146],"when":[150],"become":[153],"dense,":[156],"but":[157],"also":[158],"very":[161],"good":[162],"performance":[163],"smaller":[165],"or":[166],"sparser":[167],"graphs.":[168]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":34},{"year":2024,"cited_by_count":20},{"year":2023,"cited_by_count":27},{"year":2022,"cited_by_count":21},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":11}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}