{"id":"https://openalex.org/W1910918478","doi":"https://doi.org/10.1109/iciap.1999.797762","title":"Performance evaluation of the VF graph matching algorithm","display_name":"Performance evaluation of the VF graph matching algorithm","publication_year":2003,"publication_date":"2003-01-20","ids":{"openalex":"https://openalex.org/W1910918478","doi":"https://doi.org/10.1109/iciap.1999.797762","mag":"1910918478"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/iciap.1999.797762","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"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":[{"id":"https://openalex.org/I4210108802","display_name":"Gestione Sistemi per l\u2019Informatica (Italy)","ror":"https://ror.org/01gyw2394","country_code":"IT","type":"company","lineage":["https://openalex.org/I4210108802"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"L.P. Cordella","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Napoli, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Napoli, Italy","institution_ids":["https://openalex.org/I4210108802"]}]},{"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/I4210108802","display_name":"Gestione Sistemi per l\u2019Informatica (Italy)","ror":"https://ror.org/01gyw2394","country_code":"IT","type":"company","lineage":["https://openalex.org/I4210108802"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"P. Foggia","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Napoli, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Napoli, Italy","institution_ids":["https://openalex.org/I4210108802"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090709130","display_name":"Carlo Sansone","orcid":"https://orcid.org/0000-0002-8176-6950"},"institutions":[{"id":"https://openalex.org/I4210108802","display_name":"Gestione Sistemi per l\u2019Informatica (Italy)","ror":"https://ror.org/01gyw2394","country_code":"IT","type":"company","lineage":["https://openalex.org/I4210108802"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"C. Sansone","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Napoli, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Napoli, Italy","institution_ids":["https://openalex.org/I4210108802"]}]},{"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/I4210108802","display_name":"Gestione Sistemi per l\u2019Informatica (Italy)","ror":"https://ror.org/01gyw2394","country_code":"IT","type":"company","lineage":["https://openalex.org/I4210108802"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Vento","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Napoli, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Napoli, Italy","institution_ids":["https://openalex.org/I4210108802"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.138,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":229,"citation_normalized_percentile":{"value":0.999809,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1172","last_page":"1177"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9999,"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.9999,"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.9996,"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.9965,"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/power-graph-analysis","display_name":"Power graph analysis","score":0.47730148}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.72723603},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.64860636},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5297585},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.50113344},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48542175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4842779},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.47730148},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42540497},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15365902},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/iciap.1999.797762","pdf_url":null,"source":null,"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":8,"referenced_works":["https://openalex.org/W1488211288","https://openalex.org/W1522399527","https://openalex.org/W1655990431","https://openalex.org/W2035143052","https://openalex.org/W2126359798","https://openalex.org/W2154878346","https://openalex.org/W3202159599","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4385649199","https://openalex.org/W4220825969","https://openalex.org/W2378440737","https://openalex.org/W2376271475","https://openalex.org/W2375526705","https://openalex.org/W2366393194","https://openalex.org/W2353954046","https://openalex.org/W2122048245","https://openalex.org/W2059916315","https://openalex.org/W1992298265"],"abstract_inverted_index":{"The":[0,31,60,82,96],"paper":[1],"discusses":[2],"the":[3,23,26,44,69,73,77,101,110,114,118,128],"performance":[4,61],"of":[5,25,92,117,137],"a":[6,90,134],"graph":[7,138],"matching":[8,70,139],"algorithm":[9,97,129],"tailored":[10],"for":[11],"dealing":[12],"with":[13,51,100],"large":[14],"graphs":[15,27,93],"in":[16,34,37,76,130],"computer":[17],"vision":[18],"without":[19],"using":[20],"information":[21],"about":[22],"topology":[24],"to":[28,53],"be":[29],"matched.":[30],"algorithm,":[32],"presented":[33],"more":[35],"detail":[36],"other":[38],"papers":[39],"(and":[40],"publicly":[41],"available":[42],"on":[43,89],"WWW":[45],"as":[46],"VF),":[47],"is":[48,63,85,98],"now":[49],"discussed":[50],"reference":[52],"its":[54],"computational":[55],"complexity":[56],"and":[57,72,79],"memory":[58,75],"requirements.":[59],"analysis":[62,84],"carried":[64],"out":[65],"by":[66,87,104,123],"theoretically":[67],"characterizing":[68],"time":[71],"required":[74],"best":[78],"worst":[80],"cases.":[81],"theoretical":[83,111],"completed":[86],"tests":[88],"database":[91],"randomly":[94],"generated.":[95],"compared":[99],"one":[102],"proposed":[103],"Ullmann":[105],"(1976):":[106],"experimental":[107],"results":[108,121],"confirmed":[109],"expectations,":[112],"highlighting":[113],"overall":[115],"efficiency":[116],"algorithm.":[119],"Some":[120],"obtained":[122],"researchers":[124],"who":[125],"recently":[126],"used":[127],"application":[131],"domains":[132],"requiring":[133],"massive":[135],"use":[136],"techniques":[140],"are":[141],"finally":[142],"reported.":[143]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1910918478","counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":20},{"year":2012,"cited_by_count":20}],"updated_date":"2024-12-10T01:16:01.183788","created_date":"2016-06-24"}