{"id":"https://openalex.org/W2100937287","doi":"https://doi.org/10.1142/s021800141550010x","title":"Speeding up Fast Bipartite Graph Matching Through a New Cost Matrix","display_name":"Speeding up Fast Bipartite Graph Matching Through a New Cost Matrix","publication_year":2014,"publication_date":"2014-11-10","ids":{"openalex":"https://openalex.org/W2100937287","doi":"https://doi.org/10.1142/s021800141550010x","mag":"2100937287"},"language":"en","primary_location":{"id":"doi:10.1142/s021800141550010x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021800141550010x","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, 430003 Tarragona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat Rovira i Virgili, 430003 Tarragona, 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":8.4912,"has_fulltext":false,"cited_by_count":82,"citation_normalized_percentile":{"value":0.98302556,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"29","issue":"02","first_page":"1550010","last_page":"1550010"},"is_retracted":false,"is_paratext":false,"is_xpac":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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9965999722480774,"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.9890000224113464,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7550407648086548},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7137156128883362},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5360472798347473},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5268094539642334},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5154238939285278},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4924565255641937},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.44634294509887695},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42724502086639404},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42676669359207153},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.4219011664390564},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4049609899520874},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3312080502510071}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7550407648086548},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7137156128883362},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5360472798347473},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5268094539642334},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5154238939285278},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4924565255641937},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.44634294509887695},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42724502086639404},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42676669359207153},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.4219011664390564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4049609899520874},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3312080502510071},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s021800141550010x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021800141550010x","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":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W83683671","https://openalex.org/W200549053","https://openalex.org/W610209764","https://openalex.org/W1485714115","https://openalex.org/W1492230849","https://openalex.org/W1825911702","https://openalex.org/W1833375958","https://openalex.org/W1970615687","https://openalex.org/W1972386210","https://openalex.org/W1975675300","https://openalex.org/W1975844474","https://openalex.org/W1976466396","https://openalex.org/W1983606985","https://openalex.org/W1983681808","https://openalex.org/W1991730503","https://openalex.org/W1992887861","https://openalex.org/W1993985657","https://openalex.org/W1998777187","https://openalex.org/W2010203455","https://openalex.org/W2010541316","https://openalex.org/W2015422375","https://openalex.org/W2027805278","https://openalex.org/W2042834622","https://openalex.org/W2057126640","https://openalex.org/W2059447416","https://openalex.org/W2063216540","https://openalex.org/W2068654564","https://openalex.org/W2069506142","https://openalex.org/W2070532266","https://openalex.org/W2071660848","https://openalex.org/W2083748845","https://openalex.org/W2097829192","https://openalex.org/W2107902126","https://openalex.org/W2109294083","https://openalex.org/W2139688603","https://openalex.org/W2141461755","https://openalex.org/W2145634381","https://openalex.org/W2150760714","https://openalex.org/W2170607286","https://openalex.org/W2222512263","https://openalex.org/W2235825999"],"related_works":["https://openalex.org/W2567825307","https://openalex.org/W2945016732","https://openalex.org/W2785998768","https://openalex.org/W2804963084","https://openalex.org/W2362975861","https://openalex.org/W2352066879","https://openalex.org/W1592682627","https://openalex.org/W4295762832","https://openalex.org/W2371352078","https://openalex.org/W2054458431"],"abstract_inverted_index":{"Bipartite":[0,22],"(BP)":[1],"has":[2,24,85,110],"been":[3,25,86],"seen":[4,87],"to":[5,13,65,125],"be":[6,66],"a":[7,38,48,56,74,127],"fast":[8],"and":[9,33,51,137],"accurate":[10],"suboptimal":[11],"algorithm":[12,140],"solve":[14],"the":[15,29,44,62,70,78,88,96,133,138,142,147],"Error-Tolerant":[16],"Graph":[17],"Matching":[18],"problem.":[19],"Recently,":[20],"Fast":[21],"(FBP)":[23],"presented":[26],"that":[27,132],"obtains":[28,92,141],"same":[30,143],"distance":[31,72,75,144],"value":[32,145],"node":[34],"labelings":[35],"but":[36,83,99],"in":[37,47],"reduced":[39],"time.":[40],"Both":[41],"algorithms":[42],"approximate":[43],"quadratic":[45],"problem":[46,50],"linear":[49,90],"they":[52],"do":[53],"it":[54,84],"through":[55],"specific":[57,116],"cost":[58,117,129],"matrix.":[59],"FBP":[60],"imposes":[61],"Edit":[63,71],"costs":[64],"defined":[67],"such":[68,131],"as":[69],"is":[73,124],"function.":[76],"Originally,":[77],"Hungarian":[79,97],"method":[80,98],"was":[81],"used":[82],"Jonker\u2013Volgenant":[89,134],"solver":[91,109,135],"similar":[93],"results":[94],"than":[95,146],"with":[100],"an":[101],"important":[102],"run":[103],"time":[104],"reduction.":[105],"Nevertheless,":[106],"this":[107,122],"second":[108],"some":[111,115],"convergence":[112],"problems":[113],"on":[114],"matrices.":[118],"The":[119],"aim":[120],"of":[121],"paper":[123],"define":[126],"new":[128],"matrix":[130],"converges":[136],"matching":[139],"BP":[148],"algorithm.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":16}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}