{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:53Z","timestamp":1725663413787},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540549451"},{"type":"electronic","value":"9783540466000"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54945-5_82","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:19:57Z","timestamp":1330211997000},"page":"385-395","source":"Crossref","is-referenced-by-count":3,"title":["Parallel algorithms for finding maximal k-dependent sets and maximal f-matchings"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Diks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"Garrido","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"41_CR1","unstructured":"S. Carlsson, Y. Igarashi, K. Kanai, A. Lingas, K. Miura and Ola Petersson, Information Disseminating Schemes for Fault Tolerance in Hypercubes. Technical report, Gunma University."},{"issue":"No.4","key":"41_CR2","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole, Parallel merge sort. SIAM J. Comput., vol 17, No. 4, 1988, pp 770\u2013785.","journal-title":"SIAM J. Comput."},{"key":"41_CR3","unstructured":"H. Djidjev, O. Garrido, C. Levcopoulos and A. Lingas, On the maximum q-dependendent set problem, in the Proc. of the International Conf. for Young Computer Scientists ICYCS91. 271\u2013274."},{"key":"41_CR4","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 and Company, San Francisco, 1979."},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"M. Goldberg and T. Spencer, A New Parallel Algorithm for the Maximal Independent Set Problem. In Proc. 28th Symp. on Foundations of Computer Science, 1987.","DOI":"10.1109\/SFCS.1987.2"},{"key":"41_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(87)90169-4","volume":"25","author":"A. V. Goldberg","year":"1987","unstructured":"A. V. Goldberg and S. A. Plotkin, Parallel (\u03b4+1)-Coloring of Constant-degree Graphs. Information Processing Letters 25 (1987) 241\u2013245.","journal-title":"Information Processing Letters"},{"key":"41_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(86)90141-9","volume":"22","author":"A. Israeli","year":"1986","unstructured":"A. Israeli and Y. Shiloach, An improved parallel algorithm for maximal matching. Information Processing Letters 22 (1986) 57\u201360.","journal-title":"Information Processing Letters"},{"key":"41_CR8","unstructured":"R. M. Karp and V. Ramachandran, A Survay of Parallel Algorithms for Shared-Memory Machines. Report No. UCB\/CSD 88\/403 Computer Science Division (EECS), University of California, Berkeley, California 94720."},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"R. M. Karp and A. Wigderson, A Fast Parallel Algorithm for the Maximal Independent Set Problem. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing, 1984.","DOI":"10.1145\/800057.808690"},{"key":"41_CR10","unstructured":"L. Lov\u00e1sz and M.D. Plummer, Matching Theory, Annals of Discrete Mathematics (29). North-Holland Mathematics Studies 121. Elsevier Science Publishers B.V. ISBN 0444 879161."},{"issue":"3","key":"41_CR11","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. In SIAM J.Comput. 15, 3 (1986) pp. 1036\u20131053.","journal-title":"SIAM J.Comput."},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"N. J. Pippenger, On simultaneous resource bounds. In the Proc. 20th. Annual Symp. on Foundation of Computer Science, 1979, pp 307\u2013311.","DOI":"10.1109\/SFCS.1979.29"}],"container-title":["Lecture Notes in Computer Science","ISA'91 Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54945-5_82.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:57Z","timestamp":1605646617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54945-5_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549451","9783540466000"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-54945-5_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}