{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:48:40Z","timestamp":1752983320064},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,11,30]],"date-time":"2013-11-30T00:00:00Z","timestamp":1385769600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10107-013-0731-3","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T13:26:49Z","timestamp":1385731609000},"page":"499-518","source":"Crossref","is-referenced-by-count":9,"title":["On matching cover of graphs"],"prefix":"10.1007","volume":"147","author":[{"given":"Xiumei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoxin","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,30]]},"reference":[{"key":"731_CR1","doi-asserted-by":"crossref","unstructured":"Berge, C.: Two theorems in graph theory. Proc. Nat. Acad. Sci. USA 43, 842\u2013844 (1957)","DOI":"10.1073\/pnas.43.9.842"},{"key":"731_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)"},{"key":"731_CR3","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1137\/0215066","volume":"15","author":"WH Cunningham","year":"1986","unstructured":"Cunningham, W.H.: Improved bounds for matroid partition and intersection algorithms. SIAM J. Comput. 15, 948\u2013957 (1986)","journal-title":"SIAM J. Comput."},{"key":"731_CR4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"731_CR5","first-page":"133","volume":"2","author":"T Gallai","year":"1959","unstructured":"Gallai, T.: \u00dcber extreme Punkt- und Kantenmengen. Ann. Univ. Sci. Bp. E\u00f6tv\u00f6s Sect. Math. 2, 133\u2013138 (1959)","journal-title":"Ann. Univ. Sci. Bp. E\u00f6tv\u00f6s Sect. Math."},{"key":"731_CR6","first-page":"401","volume":"9","author":"T Gallai","year":"1964","unstructured":"Gallai, T.: Maximale Systeme unabh\u00e4angiger Kanten, Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl 9, 401\u2013413 (1964)","journal-title":"Akad. Mat. Kutat\u00f3 Int. K\u00f6zl"},{"key":"731_CR7","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Karzanov, A.V.: Maximum skew-symmetric flows. In: Algorithms\u2014ESA \u201995 (Corfu), 155\u2013170, Lecture Notes in Computer Science, vol. 979. Springer, Berlin (1995)","DOI":"10.1007\/3-540-60313-1_141"},{"key":"731_CR8","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. Lond. Math. Soc. 10, 26\u201330 (1935)","journal-title":"J. Lond. Math. Soc."},{"key":"731_CR9","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2008","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Springer, Berlin (2008)","edition":"4"},{"key":"731_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Quart."},{"key":"731_CR11","unstructured":"Lawler, E.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976)"},{"key":"731_CR12","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. Elsevier Science Publishers, BV, North Holland (1986)"},{"key":"731_CR13","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An $$O(V^{1\/2}E)$$ O ( V 1 \/ 2 E ) algorithm for finding maximum matching in general graphs. In: Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"731_CR14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1090\/S0002-9939-1959-0106853-5","volume":"10","author":"RZ Norman","year":"1959","unstructured":"Norman, R.Z., Rabin, M.O.: An algorithm for a minimum cover of a graph. Proc. Am. Math. Soc. 10, 315\u2013319 (1959)","journal-title":"Proc. Am. Math. Soc."},{"key":"731_CR15","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0731-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-013-0731-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0731-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T03:51:45Z","timestamp":1564890705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-013-0731-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,30]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["731"],"URL":"https:\/\/doi.org\/10.1007\/s10107-013-0731-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,30]]}}}