{"id":"https://openalex.org/W2801527615","doi":"https://doi.org/10.1142/s0218001418500386","title":"A Methodology to Generate Attributed Graphs with a Bounded Graph Edit Distance for Graph-Matching Testing","display_name":"A Methodology to Generate Attributed Graphs with a Bounded Graph Edit Distance for Graph-Matching Testing","publication_year":2018,"publication_date":"2018-04-27","ids":{"openalex":"https://openalex.org/W2801527615","doi":"https://doi.org/10.1142/s0218001418500386","mag":"2801527615"},"language":"en","primary_location":{"id":"doi:10.1142/s0218001418500386","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218001418500386","pdf_url":null,"source":{"id":"https://openalex.org/S41486457","display_name":"International Journal of Pattern Recognition and Artificial Intelligence","issn_l":"0218-0014","issn":["0218-0014","1793-6381"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Pattern Recognition and Artificial Intelligence","raw_type":"journal-article"},"type":"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/A5090033395","display_name":"Francesc Serratosa","orcid":"https://orcid.org/0000-0001-6112-5913"},"institutions":[{"id":"https://openalex.org/I55952717","display_name":"Universitat Rovira i Virgili","ror":"https://ror.org/00g5sqv46","country_code":"ES","type":"education","lineage":["https://openalex.org/I55952717"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Francesc Serratosa","raw_affiliation_strings":["Universitat Rovira i Virgili, Tarragona, Catalonia, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat Rovira i Virgili, Tarragona, Catalonia, Spain","institution_ids":["https://openalex.org/I55952717"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090033395"],"corresponding_institution_ids":["https://openalex.org/I55952717"],"apc_list":null,"apc_paid":null,"fwci":0.7283,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.75966021,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"32","issue":"11","first_page":"1850038","last_page":"1850038"},"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.9901999831199646,"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.9840999841690063,"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/computer-science","display_name":"Computer science","score":0.5183599591255188},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5128884315490723},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5020442008972168},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.4752892255783081},{"id":"https://openalex.org/keywords/clique-width","display_name":"Clique-width","score":0.43240463733673096},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4290599822998047},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.4236252009868622},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3763222396373749},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36841392517089844},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3641901910305023},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34929946064949036},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.334908664226532},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.29650744795799255}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5183599591255188},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5128884315490723},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5020442008972168},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.4752892255783081},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.43240463733673096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4290599822998047},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.4236252009868622},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3763222396373749},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36841392517089844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3641901910305023},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34929946064949036},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.334908664226532},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.29650744795799255},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218001418500386","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218001418500386","pdf_url":null,"source":{"id":"https://openalex.org/S41486457","display_name":"International Journal of Pattern Recognition and Artificial Intelligence","issn_l":"0218-0014","issn":["0218-0014","1793-6381"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Pattern Recognition and Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W977182947","https://openalex.org/W1969483458","https://openalex.org/W1975844474","https://openalex.org/W1976466396","https://openalex.org/W1983681808","https://openalex.org/W1996551363","https://openalex.org/W2010541316","https://openalex.org/W2027805278","https://openalex.org/W2040080630","https://openalex.org/W2064000859","https://openalex.org/W2072573705","https://openalex.org/W2083748845","https://openalex.org/W2098109165","https://openalex.org/W2100937287","https://openalex.org/W2109294083","https://openalex.org/W2122306963","https://openalex.org/W2143387021","https://openalex.org/W2150760714","https://openalex.org/W2158614393","https://openalex.org/W2159537329","https://openalex.org/W2170607286","https://openalex.org/W2345549417","https://openalex.org/W2487305562","https://openalex.org/W2528808155","https://openalex.org/W2740161549"],"related_works":["https://openalex.org/W4317940434","https://openalex.org/W3200877167","https://openalex.org/W1976617626","https://openalex.org/W4245682093","https://openalex.org/W167435155","https://openalex.org/W2950539638","https://openalex.org/W1909289562","https://openalex.org/W4291309486","https://openalex.org/W1527438798","https://openalex.org/W2183721992"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,12,42,48,123,206],"methodology":[4,200],"for":[5,87],"generating":[6,41,44],"pairs":[7],"of":[8,24,27,37,50,75,113,153],"attributed":[9],"graphs":[10,83,184,187],"with":[11,64,100,157,161,196],"lower":[13,124],"and":[14,31,53,56,125,169,209],"upper-":[15],"bounded":[16,66],"graph":[17,46,167,218],"edit":[18],"distance":[19],"(GED).":[20],"It":[21,142],"is":[22,35,143,188],"independent":[23],"the":[25,51,111,114,139,147,151,172,199,202],"type":[26],"attributes":[28],"on":[29,130],"nodes":[30],"edges.":[32],"The":[33,78],"algorithm":[34,99],"composed":[36],"three":[38],"steps:":[39],"randomly":[40],"graph,":[43],"another":[45],"as":[47],"sub-graph":[49,223],"first,":[52],"adding":[54],"structural":[55],"semantic":[57],"noise":[58],"to":[59,71,93,185,216,220],"both.":[60],"These":[61],"graphs,":[62,132],"together":[63],"their":[65],"distances,":[67],"can":[68,109,165,177,212],"be":[69,85,94,214],"used":[70,215],"manufacture":[72],"synthetic":[73],"databases":[74,168,219],"large":[76,82,131,186],"graphs.":[77],"exact":[79,222],"GED":[80,129,204],"between":[81],"cannot":[84],"obtained":[86],"runtime":[88],"reasons":[89],"since":[90],"it":[91,211],"has":[92],"computed":[95],"through":[96],"an":[97,101,126],"optimal":[98,203],"exponential":[102],"computational":[103],"cost.":[104],"Through":[105],"this":[106,162],"database,":[107],"we":[108,135,164,176],"test":[110,221],"behavior":[112,180],"known":[115],"or":[116,190],"new":[117],"sub-optimal":[118,154],"error-tolerant":[119],"graph-matching":[120],"algorithms":[121,155],"against":[122],"upper":[127],"bound":[128],"even":[133],"though":[134],"do":[136],"not":[137,144],"have":[138],"true":[140],"distance.":[141],"clear":[145],"how":[146],"error":[148],"induced":[149],"by":[150],"use":[152],"grows":[156],"problem":[158],"size.":[159],"Thus,":[160],"methodology,":[163],"generate":[166,217],"analyze":[170],"if":[171],"current":[173],"assumption":[174],"that":[175,195,210],"extrapolate":[178],"algorithms\u2019":[179],"from":[181],"matching":[182],"small":[183],"correct":[189],"not.":[191],"We":[192],"also":[193,213],"show":[194],"some":[197],"restrictions,":[198],"returns":[201],"in":[205],"quadratic":[207],"time":[208],"isomorphism":[224],"algorithms.":[225]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}