{"id":"https://openalex.org/W2007214900","doi":"https://doi.org/10.1002/net.3230130406","title":"An analysis of alternative strategies for implementing matching algorithms","display_name":"An analysis of alternative strategies for implementing matching algorithms","publication_year":1983,"publication_date":"1983-12-01","ids":{"openalex":"https://openalex.org/W2007214900","doi":"https://doi.org/10.1002/net.3230130406","mag":"2007214900"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230130406","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130406","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5035102045","display_name":"Michael O. Ball","orcid":"https://orcid.org/0000-0003-2757-8569"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael O. Ball","raw_affiliation_strings":["College of Business and Management, University of Maryland, College Park, Maryland 20742","College of Business and Management, University of Maryland, College Park, Maryland, 20742"],"affiliations":[{"raw_affiliation_string":"College of Business and Management, University of Maryland, College Park, Maryland 20742","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"College of Business and Management, University of Maryland, College Park, Maryland, 20742","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043254346","display_name":"Ulrich Derigs","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ulrich Derigs","raw_affiliation_strings":["Institut fu\u0308r Operations Research, Universita\u0308t Bonn, West Germany","Institut f\u00fcr Operations Research, Universit\u00e4t Bonn, West Germany"],"affiliations":[{"raw_affiliation_string":"Institut fu\u0308r Operations Research, Universita\u0308t Bonn, West Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"Institut f\u00fcr Operations Research, Universit\u00e4t Bonn, West Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035102045"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":6.8533,"has_fulltext":false,"cited_by_count":77,"citation_normalized_percentile":{"value":0.97225647,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"13","issue":"4","first_page":"517","last_page":"549"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976999759674072,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.8177872896194458},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6808429956436157},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6589221954345703},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6516753435134888},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5277389287948608},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5003476142883301},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4680335819721222},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.44415366649627686},{"id":"https://openalex.org/keywords/interpretation","display_name":"Interpretation (philosophy)","score":0.426836222410202},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33688414096832275},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.272369921207428}],"concepts":[{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.8177872896194458},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6808429956436157},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6589221954345703},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6516753435134888},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5277389287948608},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5003476142883301},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4680335819721222},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.44415366649627686},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.426836222410202},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33688414096832275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.272369921207428},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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":1,"locations":[{"id":"doi:10.1002/net.3230130406","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130406","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W37994088","https://openalex.org/W136000211","https://openalex.org/W1655990431","https://openalex.org/W1959130699","https://openalex.org/W2053913299","https://openalex.org/W2058494699","https://openalex.org/W2125690626","https://openalex.org/W2129301137","https://openalex.org/W2147237699","https://openalex.org/W2327315803","https://openalex.org/W3139993281"],"related_works":["https://openalex.org/W1869054031","https://openalex.org/W2509051217","https://openalex.org/W4200547882","https://openalex.org/W4313598202","https://openalex.org/W1447961680","https://openalex.org/W2054924988","https://openalex.org/W2047735395","https://openalex.org/W2085731789","https://openalex.org/W2611532517","https://openalex.org/W1775670195"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2,146],"paper":[3],"we":[4,47,135],"explore":[5],"implementation":[6],"issues":[7],"related":[8],"to":[9,42],"the":[10,13,33,39,43,104,113,122],"solution":[11],"of":[12,38,78,103],"weighted":[14],"matching":[15,44],"problem":[16],"defined":[17],"on":[18,32],"an":[19,54,66,118],"undirected":[20],"graph":[21],"G":[22],"=":[23],"(":[24],"V,":[25],"E":[26,93],").":[27],"We":[28,95],"present":[29,48],"algorithms":[30,99,123],"based":[31],"two":[34,49],"different":[35],"linear":[36,86],"characterizations":[37],"feasible":[40],"solutions":[41],"problem.":[45],"Furthermore,":[46],"specialized":[50],"implementations,":[51],"one":[52,64],"with":[53,65],"O":[55,67],"(|":[56,68],"V":[57,73,89],"|":[58,70,72,88,90,92],"3":[59],")":[60],"time":[61,75],"bound":[62],"and":[63,91,109],"V\u2016E":[69],"log":[71],"|)":[74],"bound.":[76],"Both":[77],"these":[79,98],"implementations":[80,102],"have":[81,117],"storage":[82],"requirements":[83],"that":[84,128,137],"are":[85,124],"in":[87],"|.":[94],"initially":[96],"develop":[97],"as":[100,126],"special":[101],"well\u2010known":[105],"primaldual":[106],"(blossom)":[107],"algorithm":[108],"then":[110],"show":[111,136],"how":[112],"updates":[114],"they":[115],"perform":[116],"interesting":[119],"interpretation":[120],"when":[121],"viewed":[125],"methods":[127],"successively":[129],"find":[130],"shortest":[131],"augmenting":[132],"paths.":[133],"Finally,":[134],"postoptimality":[138],"analysis":[139],"can":[140],"be":[141],"performed":[142],"very":[143],"efficiently":[144],"within":[145],"setting.":[147]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}