{"id":"https://openalex.org/W1974151163","doi":"https://doi.org/10.1002/net.3230220504","title":"Finding all minimum\u2010cost perfect matchings in Bipartite graphs","display_name":"Finding all minimum\u2010cost perfect matchings in Bipartite graphs","publication_year":1992,"publication_date":"1992-08-01","ids":{"openalex":"https://openalex.org/W1974151163","doi":"https://doi.org/10.1002/net.3230220504","mag":"1974151163"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230220504","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220504","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/A5105530217","display_name":"Komei Fukuda","orcid":null},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Komei Fukuda","raw_affiliation_strings":["Graduate School of Systems Management The University of Tsukuba 3-29-1 Otsuka, Bunkyo-ku Tokyo 112, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Systems Management The University of Tsukuba 3-29-1 Otsuka, Bunkyo-ku Tokyo 112, Japan","institution_ids":["https://openalex.org/I146399215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031287136","display_name":"Tomomi Matsui","orcid":"https://orcid.org/0000-0003-0106-0980"},"institutions":[{"id":"https://openalex.org/I161296585","display_name":"Tokyo University of Science","ror":"https://ror.org/05sj3n476","country_code":"JP","type":"education","lineage":["https://openalex.org/I161296585"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tomomi Matsui","raw_affiliation_strings":["Department of Industrial Administration Science University of Tokyo Noda, Chiba 278, Japan","Dept. of Industrial Administration, Science Univ. of Tokyo, Noda, Chiba 278 Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Administration Science University of Tokyo Noda, Chiba 278, Japan","institution_ids":["https://openalex.org/I161296585"]},{"raw_affiliation_string":"Dept. of Industrial Administration, Science Univ. of Tokyo, Noda, Chiba 278 Japan","institution_ids":["https://openalex.org/I161296585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5105530217"],"corresponding_institution_ids":["https://openalex.org/I146399215"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.9604,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.72593391,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"22","issue":"5","first_page":"461","last_page":"468"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9958000183105469,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9958000183105469,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.994700014591217,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9916999936103821,"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.8503372669219971},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6051875948905945},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.598535418510437},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5523275136947632},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5342952609062195},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.5276918411254883},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4369957745075226},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41280338168144226},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.41187092661857605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3692726492881775},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3499049246311188},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.23330029845237732},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.08927005529403687}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8503372669219971},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6051875948905945},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.598535418510437},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5523275136947632},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5342952609062195},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.5276918411254883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4369957745075226},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41280338168144226},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.41187092661857605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3692726492881775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3499049246311188},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.23330029845237732},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.08927005529403687},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.3230220504","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220504","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.56.4512","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.4512","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.misojiro.t.u-tokyo.ac.jp/~tomomi/TRs/./bip4-main.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1992340583","https://openalex.org/W2011087880","https://openalex.org/W2118382442","https://openalex.org/W2157529519","https://openalex.org/W2222512263"],"related_works":["https://openalex.org/W2567825307","https://openalex.org/W2371352078","https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W2945016732","https://openalex.org/W2785998768","https://openalex.org/W2362975861","https://openalex.org/W2804963084","https://openalex.org/W2358696866","https://openalex.org/W1607894075"],"abstract_inverted_index":{"Abstract":[0],"The":[1,31],"Hungarian":[2],"method":[3],"is":[4,41],"an":[5,22,156],"efficient":[6,23],"algorithm":[7,24,104,151,157],"for":[8,25,68,118,158],"finding":[9,26,69],"a":[10,15,106,164],"minimal\u2010cost":[11,28,132],"perfect":[12,29,39,133,143,161],"matching":[13,40],"in":[14,87,98,109,145,163],"weighted":[16],"bipartite":[17,147,166],"graph.":[18,148,167],"This":[19,61],"paper":[20],"describes":[21],"all":[27,131,142,160],"matchings.":[30],"computational":[32],"time":[33],"required":[34,81],"to":[35,89,138],"generate":[36],"each":[37],"additional":[38],"O":[42,53],"(":[43,45,54],"n":[44,46,55,99],"+":[47,56],"m":[48,57],")),":[49],"and":[50],"it":[51,94],"requires":[52],")":[58],"memory":[59,79,110],"storage.":[60],"problem":[62],"can":[63,135,152],"be":[64,136,153],"solved":[65],"by":[66,82],"algorithms":[67,85,117],"the":[70,78,83,113,128,139],"K":[71,90,119],"th\u2010best":[72,120],"solution":[73],"of":[74,130,141],"assignment":[75,121],"problems.":[76,122],"However,":[77],"storage":[80],"known":[84],"grows":[86],"proportion":[88],",":[91],"and,":[92],"hence,":[93],"may":[95],"grow":[96],"exponentially":[97],".":[100],"So,":[101],"our":[102,150],"specialized":[103],"has":[105],"considerable":[107],"advantage":[108],"requirement":[111],"over":[112],"precious":[114],"more":[115],"general":[116],"Here":[123],"we":[124],"will":[125],"show":[126],"that":[127],"enumeration":[129,140],"matchings":[134,144,162],"reduced":[137],"some":[146],"Therefore,":[149],"seen":[154],"as":[155],"enumerating":[159],"given":[165]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}