{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:21Z","timestamp":1725664521472},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613329"},{"type":"electronic","value":"9783540684619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61332-3_154","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:33:54Z","timestamp":1330292034000},"page":"209-218","source":"Crossref","is-referenced-by-count":0,"title":["Fast RNC and NC algorithms for finding a maximal set of paths with an application"],"prefix":"10.1007","author":[{"given":"Ryuhei","family":"Uehara","sequence":"first","affiliation":[]},{"given":"Zhi-Zhong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xin","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0020-0190(95)00106-M","volume":"55","author":"Z.-Z. Chen","year":"1995","unstructured":"Z.-Z. Chen, A fast and efficient NC algorithm for maximal matching, Inform. Process. Lett.\n55 (1995) 303\u2013307.","journal-title":"Inform. Process. Lett."},{"key":"22_CR2","first-page":"99","volume-title":"Lecture Notes in Computer Science, Vol. 944","author":"Z.-Z. Chen","year":"1995","unstructured":"Z.-Z. Chen, NC algorithms for finding a maximal set of paths with application to compressing strings, in: Proc. 22nd International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 944 (Springer, Berlin, 1995), 99\u2013110; journal version to appear in Theoretical Computer Science."},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(86)90144-4","volume":"22","author":"A. Israeli","year":"1986","unstructured":"A. Israeli and A. Itai, A fast and simple randomized parallel algorithm for maximal matching, Inform. Process, Lett.\n22 (1986) 77\u201380.","journal-title":"Inform. Process, Lett."},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(92)90084-9","volume":"44","author":"T. Jiang","year":"1992","unstructured":"T. Jiang, M. Li, and D.-z. Du, A note on shortest superstrings with flipping, Inform. Process. Lett. 44 (1992) 195\u2013199.","journal-title":"Inform. Process. Lett."},{"key":"22_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4400-4","volume-title":"The Design and Analysis of Algorithms","author":"D.C. Kozen","year":"1992","unstructured":"D.C. Kozen, The Design and Analysis of Algorithms (Springer, New York, 1992)."},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan, Randomized Algorithms (Cambridge University Press, 1995).","DOI":"10.1017\/CBO9780511814075"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61332-3_154.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:33Z","timestamp":1619573493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61332-3_154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613329","9783540684619"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-61332-3_154","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}