{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T10:16:28Z","timestamp":1649067388882},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1983,12]]},"DOI":"10.1007\/bf01744575","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T08:56:39Z","timestamp":1118912199000},"page":"159-183","source":"Crossref","is-referenced-by-count":3,"title":["Matching and spanning in certain planar graphs"],"prefix":"10.1007","volume":"16","author":[{"given":"J. W.","family":"Carlyle","sequence":"first","affiliation":[]},{"given":"S. A.","family":"Greibach","sequence":"additional","affiliation":[]},{"given":"A.","family":"Paz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01744575_CR1","unstructured":"Aho, A. V., Hopcroft, J. E. and Ullman, J. D.,The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974."},{"key":"BF01744575_CR2","doi-asserted-by":"crossref","unstructured":"Carlyle, J. W., Greibach, S. A. and Paz, A., \u201cA two-dimensional generating system modeling growth by binary cell division,\u201dProc. 15th Ann. Symp. on Switching and Automata Theory, October 1974, New Orleans, LA, 1\u201312.","DOI":"10.1109\/SWAT.1974.3"},{"key":"BF01744575_CR3","first-page":"207","volume":"38","author":"G. D. Danzig","year":"1956","unstructured":"Danzig, G. D. and Hofman, A. J., \u201cDilworth theorem on partially ordered sets,\u201dAnnals of Math. Studies, 38 (1956) 207\u2013214.","journal-title":"Annals of Math. Studies"},{"key":"BF01744575_CR4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R. P. Dilworth","year":"1950","unstructured":"Dilworth, R. P., \u201cA decomposition theorem,\u201dAnnals of Math., 51 (1950) 161\u2013166.","journal-title":"Annals of Math."},{"key":"BF01744575_CR5","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J., \u201cPaths, trees, and flowers,\u201dCanadian J. Math., 17 (1965) 449\u2013467.","journal-title":"Canadian J. Math."},{"key":"BF01744575_CR6","doi-asserted-by":"crossref","unstructured":"Even, S. and Kariv, O., \u201cAnO(n 2.5) algorithm for maximum matching in general graphs,\u201dProc. 16th Ann. Symp. on Foundations of Computer Science, October 1975, Berkeley, CA, 100\u2013112.","DOI":"10.1109\/SFCS.1975.5"},{"key":"BF01744575_CR7","unstructured":"Gabow, H., \u201cAn efficient implementation of Edmonds' Maximum Matching Algorithm,\u201dTech. Rpt. No. 31, Stan-CS 72\u2013328. June 1972."},{"key":"BF01744575_CR8","unstructured":"Garey, M. R. and Johnson, D. S.,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979."},{"key":"BF01744575_CR9","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M. R. Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S. and Tarjan, R. E., \u201cThe planar Hamiltonian circuit problem isNP-complete,\u201dSIAM J. Comput., 5 (1976) 704\u2013714.","journal-title":"SIAM J. Comput."},{"key":"BF01744575_CR10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"Hopcroft, J. E. and Karp. R. M., \u201cAnn 5\/2 algorithm for maximum matchings in bipartite graphs,\u201dSIAM J. Comput., 2 (1973) 225\u2013231.","journal-title":"SIAM J. Comput."},{"key":"BF01744575_CR11","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. E. Hopcroft","year":"1974","unstructured":"Hopcroft, J. E. and Tarjan, R. E., \u201cEfficient planarity testing,\u201dJACM, 21 (1974) 549\u2013568.","journal-title":"JACM"},{"key":"BF01744575_CR12","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0202024","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"Hopcroft, J. E. and Ullman, J. D., \u201cSet merging algorithms,\u201dSIAM J. Comput., 2 (1973) 294\u2013303.","journal-title":"SIAM J. Comput."},{"key":"BF01744575_CR13","unstructured":"Horowitz, E. and Sahni, S.,Fundamentals of Computer Algorithms, Computer Science Press, 1978."},{"key":"BF01744575_CR14","first-page":"1297","volume":"272","author":"M. Vergnas Las","year":"1971","unstructured":"Las Vergnas, M., \u201cSur une propri\u00e9t\u00e9 des arbres maximaux dans un graphe,\u201dC.R. Acad. Sci. Paris, Serie A, 272 (1971) 1297\u20131300.","journal-title":"C.R. Acad. Sci. Paris, Serie A"},{"key":"BF01744575_CR15","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R. E. Tarjan","year":"1975","unstructured":"Tarjan, R. E., \u201cOn the efficiency of a good but not linear set merging algorithm,\u201dJACM, 22 (1975) 215\u2013225.","journal-title":"JACM"},{"key":"BF01744575_CR16","doi-asserted-by":"crossref","unstructured":"Micali, S. and Vazirani, V. V., \u201cAn $$O(\\sqrt {\\left| \\upsilon \\right|} \\cdot \\left| E \\right|)$$ Algorithm for finding maximum matching in general graphs,\u201dProceedings of the 21st Annual Symposium on Foundations of Computer Science, October 1980, Syracuse, N.Y., 17\u201327.","DOI":"10.1109\/SFCS.1980.12"},{"key":"BF01744575_CR17","unstructured":"Even, S.Graph Algorithms, Computer Science Press, 1979."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01744575.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01744575\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01744575","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T19:25:23Z","timestamp":1586287523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01744575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["BF01744575"],"URL":"https:\/\/doi.org\/10.1007\/bf01744575","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}