{"id":"https://openalex.org/W2147405597","doi":"https://doi.org/10.1109/tpami.2004.75","title":"A (sub)graph isomorphism algorithm for matching large graphs","display_name":"A (sub)graph isomorphism algorithm for matching large graphs","publication_year":2004,"publication_date":"2004-08-16","ids":{"openalex":"https://openalex.org/W2147405597","doi":"https://doi.org/10.1109/tpami.2004.75","mag":"2147405597","pmid":"https://pubmed.ncbi.nlm.nih.gov/15641723"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpami.2004.75","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":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5009276474","display_name":"L.P. Cordella","orcid":null},"institutions":[],"countries":["IT"],"is_corresponding":false,"raw_author_name":"L.P. Cordella","raw_affiliation_strings":["Dipt. di Inf. e Sistemistica, Univ. di Napoli Federico II, Italy"],"affiliations":[{"raw_affiliation_string":"Dipt. di Inf. e Sistemistica, Univ. di Napoli Federico II, Italy","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082731857","display_name":"Pasquale Foggia","orcid":"https://orcid.org/0000-0002-7096-1902"},"institutions":[],"countries":["IT"],"is_corresponding":false,"raw_author_name":"P. Foggia","raw_affiliation_strings":["Dipt. di Inf. e Sistemistica, Univ. di Napoli Federico II, Italy"],"affiliations":[{"raw_affiliation_string":"Dipt. di Inf. e Sistemistica, Univ. di Napoli Federico II, Italy","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090709130","display_name":"Carlo Sansone","orcid":"https://orcid.org/0000-0002-8176-6950"},"institutions":[],"countries":["IT"],"is_corresponding":false,"raw_author_name":"C. Sansone","raw_affiliation_strings":["Dipt. di Inf. e Sistemistica, Univ. di Napoli Federico II, Italy"],"affiliations":[{"raw_affiliation_string":"Dipt. di Inf. e Sistemistica, Univ. di Napoli Federico II, Italy","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110251352","display_name":"M. Vento","orcid":null},"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":"M. Vento","raw_affiliation_strings":["[Dipartimento di Ingegneria dellInformazione e di Ingegneria Elettrica, Universit\u00e1 di Salerno, Fisciano, Italy]"],"affiliations":[{"raw_affiliation_string":"[Dipartimento di Ingegneria dellInformazione e di Ingegneria Elettrica, Universit\u00e1 di Salerno, Fisciano, Italy]","institution_ids":["https://openalex.org/I131729948"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.333,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1364,"citation_normalized_percentile":{"value":0.98221,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"26","issue":"10","first_page":"1367","last_page":"1372"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":1.0,"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":1.0,"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/T11106","display_name":"Data Management and Algorithms","score":0.9988,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9941,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8844541},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.8537208},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5383336},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.5206577},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.5122525},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4532361}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.8844541},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.8537208},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7761868},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6343438},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5383336},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.5206577},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5184457},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5122525},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.50772154},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.48695883},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4592656},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4532361},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4396414},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38357434},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36098343},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25615472},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.24532875},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"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/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":"","qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D001185","descriptor_name":"Artificial Intelligence","qualifier_ui":"","qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003196","descriptor_name":"Computer Graphics","qualifier_ui":"","qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D007089","descriptor_name":"Image Enhancement","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":true},{"descriptor_ui":"D007090","descriptor_name":"Image Interpretation, Computer-Assisted","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":true},{"descriptor_ui":"D010363","descriptor_name":"Pattern Recognition, Automated","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":true},{"descriptor_ui":"D013382","descriptor_name":"Subtraction Technique","qualifier_ui":"","qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D016000","descriptor_name":"Cluster Analysis","qualifier_ui":"","qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D007089","descriptor_name":"Image Enhancement","qualifier_ui":"","qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D007090","descriptor_name":"Image Interpretation, Computer-Assisted","qualifier_ui":"","qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D021621","descriptor_name":"Imaging, Three-Dimensional","qualifier_ui":"","qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D021621","descriptor_name":"Imaging, Three-Dimensional","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D016247","descriptor_name":"Information Storage and Retrieval","qualifier_ui":"","qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D016247","descriptor_name":"Information Storage and Retrieval","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D009716","descriptor_name":"Numerical Analysis, Computer-Assisted","qualifier_ui":"","qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D010363","descriptor_name":"Pattern Recognition, Automated","qualifier_ui":"","qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D015203","descriptor_name":"Reproducibility of Results","qualifier_ui":"","qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D012680","descriptor_name":"Sensitivity and Specificity","qualifier_ui":"","qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D012815","descriptor_name":"Signal Processing, Computer-Assisted","qualifier_ui":"","qualifier_name":null,"is_major_topic":false}],"locations_count":2,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpami.2004.75","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":null,"is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/15641723","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":["National Institutes of Health"],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":19,"referenced_works":["https://openalex.org/W1488211288","https://openalex.org/W1522399527","https://openalex.org/W1910918478","https://openalex.org/W1974318365","https://openalex.org/W1974672137","https://openalex.org/W1983000967","https://openalex.org/W2013363798","https://openalex.org/W2035143052","https://openalex.org/W2045527716","https://openalex.org/W2098350459","https://openalex.org/W2109294083","https://openalex.org/W2121884935","https://openalex.org/W2122306963","https://openalex.org/W2126359798","https://openalex.org/W2136761100","https://openalex.org/W2152475379","https://openalex.org/W2158441602","https://openalex.org/W3106926726","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4245682093","https://openalex.org/W3177772509","https://openalex.org/W2954463587","https://openalex.org/W2915540008","https://openalex.org/W2906832313","https://openalex.org/W2393701947","https://openalex.org/W2147405597","https://openalex.org/W2032950096","https://openalex.org/W2018568077","https://openalex.org/W1482551403"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"algorithm":[3,21,44],"for":[4,11,34],"graph":[5],"isomorphism":[6,9,36],"and":[7,39,53,73,91],"subgraph":[8],"suited":[10],"dealing":[12,99],"with":[13,68,100,114],"large":[14,60,115],"graphs.":[15,42,116],"A":[16],"first":[17],"version":[18],"of":[19,37,78,87,108],"the":[20,35,106,109],"has":[22],"been":[23],"presented":[24],"in":[25,66],"a":[26,56,79,83,96],"previous":[27],"paper,":[28],"where":[29],"we":[30],"examined":[31],"its":[32,50,62],"performance":[33,58],"small":[38],"medium":[40],"size":[41],"The":[43,76],"is":[45],"improved":[46],"here":[47],"to":[48,54,71,95],"reduce":[49],"spatial":[51],"complexity":[52],"achieve":[55],"better":[57],"on":[59,82,92],"graphs;":[61],"features":[63],"are":[64,103],"analyzed":[65],"detail":[67],"special":[69],"reference":[70],"time":[72],"memory":[74],"requirements.":[75],"results":[77],"testing":[80],"performed":[81],"publicly":[84],"available":[85],"database":[86],"synthetically":[88],"generated":[89],"graphs":[90,93],"relative":[94],"real":[97],"application":[98],"technical":[101],"drawings":[102],"presented,":[104],"confirming":[105],"effectiveness":[107],"approach,":[110],"especially":[111],"when":[112],"working":[113]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2147405597","counts_by_year":[{"year":2024,"cited_by_count":86},{"year":2023,"cited_by_count":91},{"year":2022,"cited_by_count":75},{"year":2021,"cited_by_count":125},{"year":2020,"cited_by_count":87},{"year":2019,"cited_by_count":135},{"year":2018,"cited_by_count":96},{"year":2017,"cited_by_count":96},{"year":2016,"cited_by_count":80},{"year":2015,"cited_by_count":96},{"year":2014,"cited_by_count":81},{"year":2013,"cited_by_count":73},{"year":2012,"cited_by_count":68}],"updated_date":"2025-01-02T07:12:29.637439","created_date":"2016-06-24"}