{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T14:12:20Z","timestamp":1697983940829},"reference-count":27,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7223,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1987,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The matching problem in bipartite graphs can be solved by an elegant primal\u2010dual algorithm. The purpose of this paper is to introduce concepts which make it possible to generalize this algorithm to some classes of hypergraphs. We illustrate the approach by providing a polynomial primal\u2010dual algorithm for the matching problem in hypergraphs without odd cycles.<\/jats:p>","DOI":"10.1002\/net.3230170402","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T22:21:32Z","timestamp":1178922092000},"page":"365-386","source":"Crossref","is-referenced-by-count":1,"title":["An algorithmic framework for the matching problem in some hypergraphs"],"prefix":"10.1002","volume":"17","author":[{"given":"Michele","family":"Conforti","sequence":"first","affiliation":[]},{"given":"Gerard","family":"Cornuejols","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"E.Balas V.Chvatal andJ.Nesetril On the maximum weighted clique problem. MSRR No. 518 Graduate School of Industrial Administration Carnegie Mellon University 1985."},{"key":"e_1_2_1_3_2","unstructured":"C.Berge Farbung von Graphen deren s\u00e4mtliche bzw deren ungerade kreise starr sind (Zusammenfassung). Will. Z. Martin Luther Univ. Hall Wittenberg Math. Natur. Reihe 114 1961."},{"key":"e_1_2_1_4_2","volume-title":"Graphes et Hypergraphes","author":"Berge C.","year":"1973"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584535"},{"key":"e_1_2_1_6_2","first-page":"175","volume-title":"Sur un theoreme du type K\u00f6nig pour hypergraphes","author":"Berge C.","year":"1970"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90160-2"},{"key":"e_1_2_1_8_2","first-page":"225","article-title":"Polynominal algorithm to recognize a Meyniel graph","volume":"21","author":"Burlet M.","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_9_2","first-page":"1","article-title":"Parity graphs","volume":"16","author":"Burlet M.","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(75)90041-6"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030406"},{"key":"e_1_2_1_12_2","unstructured":"M.ConfortiandM. R.Rao Structural properties and recognition of restricted and strongly unimodular matrices. Math. Progr. (submitted for publication)."},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"e_1_2_1_14_2","first-page":"440","article-title":"Permutation graphs and transitive graphs","volume":"19","author":"Even S.","year":"1972","journal-title":"Jo. ACM"},{"key":"e_1_2_1_15_2","unstructured":"A.Frank Some polynomial algorithms for certain graphs and hypergraphs. Proc. 5th British Combin. Conference Winnipeg 1976."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584085"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030305"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040407"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589347"},{"key":"e_1_2_1_20_2","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"Kachian L. G.","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"e_1_2_1_21_2","doi-asserted-by":"crossref","unstructured":"N.Karmarkar A new polynomial time algorithm for linear programming. Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing Washington (1984)302\u2013311.","DOI":"10.1145\/800057.808695"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030404"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90006-4"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90074-X"},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580235"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90287-R"},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90075-1"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.2.280"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230170402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230170402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T03:53:46Z","timestamp":1697860426000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230170402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["10.1002\/net.3230170402"],"URL":"https:\/\/doi.org\/10.1002\/net.3230170402","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}