{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:04:37Z","timestamp":1725487477765},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725879"},{"type":"electronic","value":"9783540725886"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72588-6_66","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T18:35:23Z","timestamp":1184610923000},"page":"401-409","source":"Crossref","is-referenced-by-count":4,"title":["Finding the (n, k, 0)-Extendability in Bipartite Graphs and Its Application"],"prefix":"10.1007","author":[{"given":"Yueping","family":"Li","sequence":"first","affiliation":[]},{"given":"Dingjun","family":"Lou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"66_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0012-365X(02)00827-0","volume":"269","author":"R. Aldred","year":"2003","unstructured":"Aldred, R., Holton, D., Lou, D., Saito, A.: M-alternating Paths in n-extendable Bipartite Graphs. Discrete Math.\u00a0269, 1\u201311 (2003)","journal-title":"Discrete Math."},{"key":"66_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0020-0190(97)00177-4","volume":"65","author":"J. Lakhal","year":"1998","unstructured":"Lakhal, J., Litzler, L.: A Polynomial Algorithm for the Extendability Problem in Bipartite Graphs. Information Processing Letters\u00a065, 11\u201316 (1998)","journal-title":"Information Processing Letters"},{"key":"66_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0012-365X(00)00328-9","volume":"231","author":"G. Liu","year":"2001","unstructured":"Liu, G., Yu, Q.: Generlization of Matching Extensions in Graphs. Discrete Math.\u00a0231, 311\u2013320 (2001)","journal-title":"Discrete Math."},{"key":"66_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.disc.2004.10.019","volume":"290","author":"D. Lou","year":"2005","unstructured":"Lou, D., Saito, A., Teng, L.: A Note on Internally Disjoint Alternating Paths in Bipartite Graphs. Discrete Math.\u00a0290, 105\u2013108 (2005)","journal-title":"Discrete Math."},{"key":"66_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0012-365X(92)00485-A","volume":"127","author":"M. Plummer","year":"1994","unstructured":"Plummer, M.: Extending Matchings in Graphs: a Survey. Discrete Math.\u00a0127, 277\u2013292 (1994)","journal-title":"Discrete Math."},{"key":"66_CR6","first-page":"3","volume":"116","author":"M. Plummer","year":"1996","unstructured":"Plummer, M.: Extending Matchings in Graphs: an Update. Congr. Numer.\u00a0116, 3\u201332 (1996)","journal-title":"Congr. Numer."},{"key":"66_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0012-365X(80)90037-0","volume":"31","author":"M. Plummer","year":"1980","unstructured":"Plummer, M.: On n-extendable Graphs. Discrete Math.\u00a031, 201\u2013210 (1980)","journal-title":"Discrete Math."},{"key":"66_CR8","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1016\/j.disc.2005.12.025","volume":"306","author":"F. Zhang","year":"2006","unstructured":"Zhang, F., Zhang, H.: Construction for Bicritical Graphs and k-extendable Bipartite Graphs. Discrete Math.\u00a0306, 1415\u20131423 (2006)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72588-6_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T23:58:28Z","timestamp":1558483108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72588-6_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725879","9783540725886"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72588-6_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}