{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:53Z","timestamp":1770972413511,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0020-0190(97)00177-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"11-16","source":"Crossref","is-referenced-by-count":9,"title":["A polynomial algorithm for the extendability problem in bipartite graphs"],"prefix":"10.1016","volume":"65","author":[{"given":"J.","family":"Lakhal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Litzler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00177-4_BIB1","article-title":"Graphs that are critical with respect to matching extension and diameter","author":"Ananchuen","year":"1994"},{"key":"10.1016\/S0020-0190(97)00177-4_BIB2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0167-6377(94)90049-3","article-title":"Persistency in maximum cardinality bipartite matchings","volume":"15","author":"Costa","year":"1994","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"10.1016\/S0020-0190(97)00177-4_BIB3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","article-title":"Matrix multiplication via arithmetic progressions","volume":"9","author":"Coppersmith","year":"1990","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0020-0190(97)00177-4_BIB4","series-title":"Graphes et Algorithmes","author":"Gondran","year":"1985"},{"key":"10.1016\/S0020-0190(97)00177-4_BIB5","series-title":"Proc. 37th Ann. Symp. on Foundations of Computer Science","first-page":"462","article-title":"Computing vertex connectivity: new bounds from old techniques","author":"Henzinger","year":"1996"},{"issue":"4","key":"10.1016\/S0020-0190(97)00177-4_BIB6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n12 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00177-4_BIB7","series-title":"An Introduction to Parallel Algorithms","author":"Jaja","year":"1992"},{"key":"10.1016\/S0020-0190(97)00177-4_BIB8","first-page":"437","article-title":"Fast parallel algorithms for testing k-connectivity of directed and undirected graphs","volume":"vol. 1","author":"Liang","year":"1995"},{"key":"10.1016\/S0020-0190(97)00177-4_BIB9","first-page":"544","article-title":"Matching Theory","volume":"29","author":"Lovasz","year":"1986"},{"key":"10.1016\/S0020-0190(97)00177-4_BIB10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0012-365X(80)90037-0","article-title":"On n-extendable graphs","volume":"31","author":"Plummer","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(97)00177-4_BIB11","first-page":"245","article-title":"Matching extension in bipartite graphs","volume":"54","author":"Plummer","year":"1986"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001774?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001774?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:53:40Z","timestamp":1555959220000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097001774"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0020019097001774"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00177-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}