Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1986: Mathematical Foundations of Computer Science 1986 pp 379–385Cite as

Some improved parallelisms for graphs

  • Communications
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 233))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. V. Aho, J. E. Hopcroft, J. D. Ullman, The design and analysis of computer algorithms, Addison-Wesley 1974.

    Google Scholar 

  2. 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–488.

    Google Scholar 

  3. F. Y. Chin, I. Lam, I. Chen, Optimal parallel algorithms for the connected component problems, Proc. Int. Conf. on Parallel Processing (1981), 170–175.

    Google Scholar 

  4. J. Ja'Ja', J. Simon, Parallel algorithms in graph theory: planarity testing, SIAM J. Comp. 11(1982), 314–328.

    Google Scholar 

  5. L. Janiga, V. Koubek, A note on finding minimum cuts in directed planar networks by parallel computation, Inf. Proc. Letters 21(1985), 75–78.

    Google Scholar 

  6. V. Koubek, J. Kršňáková, Parallel algorithms for connected components in a graph, Proc. of FCT, Lecture Notes in Comp. Sci. 199(1985), 208–217.

    Google Scholar 

  7. V. Koubek, J. Kršňáková, Nearly optimal algorithms for connected components in a graph, to appear.

    Google Scholar 

  8. L. Kučera, Parallel computation and conflicts in memory access, Inf. Proc. Letters 14(1982), 93–96.

    Google Scholar 

  9. S. MacLane, A combinatorial condition for planar graphs, Fund. Math. 28(1937), 22–32.

    Google Scholar 

  10. S. MacLane, A structural characterization of planar combinatorial graphs, Duke Math. J. 3(1937), 460–472.

    Google Scholar 

  11. R. E. Tarjan, U. Vishkin, Finding biconnected components and computing tree functions in logarithmic parallel time, Proc. of 25th Symp. on FOCS, 1984, 14–20.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University, Malostr. n. 25, 118 00, Praha 1, Czechoslovakia

    A. Goralčíková & V. Koubek

Authors
  1. A. Goralčíková
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Koubek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goralčíková, A., Koubek, V. (1986). Some improved parallelisms for graphs. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016262

Download citation

  • DOI: https://doi.org/10.1007/BFb0016262

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation