{"id":"https://openalex.org/W2043101215","doi":"https://doi.org/10.1016/0166-218x(92)90165-7","title":"Minimum perfect bipartite matchings and spanning trees under categorization","display_name":"Minimum perfect bipartite matchings and spanning trees under categorization","publication_year":1992,"publication_date":"1992-10-01","ids":{"openalex":"https://openalex.org/W2043101215","doi":"https://doi.org/10.1016/0166-218x(92)90165-7","mag":"2043101215"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(92)90165-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(92)90165-7","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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/A5005518582","display_name":"Michael B. Richey","orcid":null},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael B. Richey","raw_affiliation_strings":["Operations Research & Applied Statistics Department, George Mason University, Fairfax, VA 22030, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research & Applied Statistics Department, George Mason University, Fairfax, VA 22030, USA","institution_ids":["https://openalex.org/I162714631"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079361771","display_name":"Abraham P. Punnen","orcid":"https://orcid.org/0000-0002-3859-9229"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Abraham P. Punnen","raw_affiliation_strings":["Mathematics Department, Indian Institute of Technology, Kanpur -208 016, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics Department, Indian Institute of Technology, Kanpur -208 016, India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":1.441,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.81723519,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"39","issue":"2","first_page":"147","last_page":"153"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9969000220298767,"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/mathematics","display_name":"Mathematics","score":0.8718795776367188},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8459426164627075},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7822475433349609},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.634142279624939},{"id":"https://openalex.org/keywords/categorization","display_name":"Categorization","score":0.5190573334693909},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5182595252990723},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4807446002960205},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.44829726219177246},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36352840065956116},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15730389952659607},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.15458714962005615},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14797121286392212},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08230343461036682}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8718795776367188},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8459426164627075},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7822475433349609},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.634142279624939},{"id":"https://openalex.org/C94124525","wikidata":"https://www.wikidata.org/wiki/Q912550","display_name":"Categorization","level":2,"score":0.5190573334693909},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5182595252990723},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4807446002960205},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.44829726219177246},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36352840065956116},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15730389952659607},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.15458714962005615},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14797121286392212},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08230343461036682}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0166-218x(92)90165-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(92)90165-7","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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":18,"referenced_works":["https://openalex.org/W1968242178","https://openalex.org/W1986911155","https://openalex.org/W2001312534","https://openalex.org/W2003021478","https://openalex.org/W2011039300","https://openalex.org/W2011308503","https://openalex.org/W2033040247","https://openalex.org/W2043569906","https://openalex.org/W2048013200","https://openalex.org/W2066356146","https://openalex.org/W2066907198","https://openalex.org/W2073713739","https://openalex.org/W2157529519","https://openalex.org/W2168519107","https://openalex.org/W2401610261","https://openalex.org/W2753176400","https://openalex.org/W4249958171","https://openalex.org/W6644040475"],"related_works":["https://openalex.org/W2157421865","https://openalex.org/W2032442730","https://openalex.org/W2069230977","https://openalex.org/W2020354668","https://openalex.org/W2381560035","https://openalex.org/W2043958520","https://openalex.org/W1495629564","https://openalex.org/W2359506224","https://openalex.org/W3183894834","https://openalex.org/W2062226917"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}