{"id":"https://openalex.org/W2049186729","doi":"https://doi.org/10.1002/net.3230170402","title":"An algorithmic framework for the matching problem in some hypergraphs","display_name":"An algorithmic framework for the matching problem in some hypergraphs","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W2049186729","doi":"https://doi.org/10.1002/net.3230170402","mag":"2049186729"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230170402","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170402","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/A5091505775","display_name":"Michele Conforti","orcid":null},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michele Conforti","raw_affiliation_strings":["Department of Computer Science, New York University, New York, New York 10003","New York Univ, New York, NY,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, New York University, New York, New York 10003","institution_ids":["https://openalex.org/I57206974"]},{"raw_affiliation_string":"New York Univ, New York, NY,","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014470090","display_name":"G\u00e9rard Cornu\u00e9jols","orcid":"https://orcid.org/0000-0002-3976-1021"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gerard Cornuejols","raw_affiliation_strings":["Department of Industrial Administration, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213","Carnegie-Mellon University, Pittsburgh, PA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Administration, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091505775"],"corresponding_institution_ids":["https://openalex.org/I57206974"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.5471,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.81653435,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"4","first_page":"365","last_page":"386"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9973999857902527,"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/T11476","display_name":"Graph theory and applications","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.8763194680213928},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7175881862640381},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.6017905473709106},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.553995668888092},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.497205525636673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4858055114746094},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45758333802223206},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4456779658794403},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42655321955680847},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3698403835296631},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35999298095703125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34055137634277344},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3267122507095337},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1720488965511322}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8763194680213928},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7175881862640381},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.6017905473709106},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.553995668888092},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.497205525636673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4858055114746094},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45758333802223206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4456779658794403},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42655321955680847},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3698403835296631},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35999298095703125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34055137634277344},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3267122507095337},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1720488965511322},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230170402","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170402","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":25,"referenced_works":["https://openalex.org/W1482143660","https://openalex.org/W1963707128","https://openalex.org/W1997998268","https://openalex.org/W2001258629","https://openalex.org/W2001949253","https://openalex.org/W2010856983","https://openalex.org/W2022971294","https://openalex.org/W2040101882","https://openalex.org/W2041670460","https://openalex.org/W2048237851","https://openalex.org/W2049716158","https://openalex.org/W2052850644","https://openalex.org/W2056260683","https://openalex.org/W2056843540","https://openalex.org/W2058408846","https://openalex.org/W2068244470","https://openalex.org/W2075160229","https://openalex.org/W2076680677","https://openalex.org/W2088028898","https://openalex.org/W2611147814","https://openalex.org/W3176255773","https://openalex.org/W4206780782","https://openalex.org/W4233756358","https://openalex.org/W6655997887","https://openalex.org/W6815833212"],"related_works":["https://openalex.org/W2352066879","https://openalex.org/W2348257368","https://openalex.org/W2054458431","https://openalex.org/W2077309407","https://openalex.org/W2184969544","https://openalex.org/W2371352078","https://openalex.org/W1592682627","https://openalex.org/W2080136900","https://openalex.org/W4295762832","https://openalex.org/W2561454982"],"abstract_inverted_index":{"Abstract":[0],"The":[1,15],"matching":[2,49],"problem":[3,50],"in":[4,51],"bipartite":[5],"graphs":[6],"can":[7],"be":[8],"solved":[9],"by":[10,41],"an":[11],"elegant":[12],"primal\u2010dual":[13,45],"algorithm.":[14],"purpose":[16],"of":[17,35],"this":[18,30],"paper":[19],"is":[20],"to":[21,28,32],"introduce":[22],"concepts":[23],"which":[24],"make":[25],"it":[26],"possible":[27],"generalize":[29],"algorithm":[31,46],"some":[33],"classes":[34],"hypergraphs.":[36],"We":[37],"illustrate":[38],"the":[39,48],"approach":[40],"providing":[42],"a":[43],"polynomial":[44],"for":[47],"hypergraphs":[52],"without":[53],"odd":[54],"cycles.":[55]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}