{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:26Z","timestamp":1725455426384},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016262","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T00:39:17Z","timestamp":1131842357000},"page":"379-385","source":"Crossref","is-referenced-by-count":1,"title":["Some improved parallelisms for graphs"],"prefix":"10.1007","author":[{"given":"A.","family":"Goral\u010d\u00edkov\u00e1","sequence":"first","affiliation":[]},{"given":"V.","family":"Koubek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"A. V. Aho, J. E. Hopcroft, J. D. Ullman, The design and analysis of computer algorithms, Addison-Wesley 1974."},{"key":"33_CR2","first-page":"487","volume":"194","author":"V. L. Arlazarov","year":"1970","unstructured":"V. L. Arlazarov, E. A. Dinic, M. A. Kronrod, I. A. Faradzev, Ob ekonomnom postrojenii tranzitivnogo zamykanija grafa (Russian), Dokl. AN SSSR 194(1970), 487\u2013488.","journal-title":"Dokl. AN SSSR"},{"key":"33_CR3","unstructured":"F. Y. Chin, I. Lam, I. Chen, Optimal parallel algorithms for the connected component problems, Proc. Int. Conf. on Parallel Processing (1981), 170\u2013175."},{"key":"33_CR4","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1137\/0211024","volume":"11","author":"J. Ja'Ja'","year":"1982","unstructured":"J. Ja'Ja', J. Simon, Parallel algorithms in graph theory: planarity testing, SIAM J. Comp. 11(1982), 314\u2013328.","journal-title":"SIAM J. Comp."},{"key":"33_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0020-0190(85)90036-5","volume":"21","author":"L. Janiga","year":"1985","unstructured":"L. Janiga, V. Koubek, A note on finding minimum cuts in directed planar networks by parallel computation, Inf. Proc. Letters 21(1985), 75\u201378.","journal-title":"Inf. Proc. Letters"},{"key":"33_CR6","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/BFb0028804","volume":"199","author":"V. Koubek","year":"1985","unstructured":"V. Koubek, J. Kr\u0161\u0148\u00e1kov\u00e1, Parallel algorithms for connected components in a graph, Proc. of FCT, Lecture Notes in Comp. Sci. 199(1985), 208\u2013217.","journal-title":"Proc. of FCT, Lecture Notes in Comp. Sci."},{"key":"33_CR7","unstructured":"V. Koubek, J. Kr\u0161\u0148\u00e1kov\u00e1, Nearly optimal algorithms for connected components in a graph, to appear."},{"key":"33_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","volume":"14","author":"L. Ku\u010dera","year":"1982","unstructured":"L. Ku\u010dera, Parallel computation and conflicts in memory access, Inf. Proc. Letters 14(1982), 93\u201396.","journal-title":"Inf. Proc. Letters"},{"key":"33_CR9","doi-asserted-by":"crossref","first-page":"22","DOI":"10.4064\/fm-28-1-22-32","volume":"28","author":"S. MacLane","year":"1937","unstructured":"S. MacLane, A combinatorial condition for planar graphs, Fund. Math. 28(1937), 22\u201332.","journal-title":"Fund. Math."},{"key":"33_CR10","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1215\/S0012-7094-37-00336-3","volume":"3","author":"S. MacLane","year":"1937","unstructured":"S. MacLane, A structural characterization of planar combinatorial graphs, Duke Math. J. 3(1937), 460\u2013472.","journal-title":"Duke Math. J."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan, U. Vishkin, Finding biconnected components and computing tree functions in logarithmic parallel time, Proc. of 25th Symp. on FOCS, 1984, 14\u201320.","DOI":"10.1109\/SFCS.1984.715896"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016262.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T12:07:09Z","timestamp":1626696429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0016262","relation":{},"subject":[]}}