{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:56Z","timestamp":1725663656780},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540534877"},{"type":"electronic","value":"9783540463139"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53487-3_47","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:06:05Z","timestamp":1330207565000},"page":"225-231","source":"Crossref","is-referenced-by-count":1,"title":["A fast parallel algorithm for finding a maximal bipartite set"],"prefix":"10.1007","author":[{"given":"David","family":"Pearson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay","family":"Vazirani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"N. Alon, L. Babai and A. Itai. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. J. Algorithms 7 (1986), pp. 567\u2013583.","journal-title":"J. Algorithms"},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. A. Cook","year":"1985","unstructured":"S. A. Cook. Taxonomy of Problems with Fast Parallel Algorithms. Information and Control 64 (1985), pp. 2\u201322.","journal-title":"Information and Control"},{"key":"17_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)."},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1137\/0218029","volume":"18","author":"M. Goldberg","year":"1989","unstructured":"M. Goldberg and T. Spencer. A New Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Computing 18 (1989), pp. 419\u2013427.","journal-title":"SIAM J. Computing"},{"key":"17_CR5","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary, Graph Theory. Addison-Wesley, Reading, Mass. (1969)."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"R. M. Karp and A. Wigderson. A Fast Parallel Algorithm for the Maximal Independent Set Problem. In Proc. 16th Annual ACM Symposium on Theory of Computing (1984), pp. 266\u2013272.","DOI":"10.1145\/800057.808690"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Computing 15 (1986), pp. 1036\u20131053.","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53487-3_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:12:46Z","timestamp":1619572366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53487-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540534877","9783540463139"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-53487-3_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}