Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1993: Algorithms and Computation pp 303–312Cite as

Parallel construction of canonical ordering and convex drawing of triconnected planar graphs

  • Conference paper
  • First Online:

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

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. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, A simple tree contraction algorithm, Journal of Algorithms 10 (1989), pp. 287–302.

    Article  Google Scholar 

  2. M. Chrobak and T. Payne, A linear time algorithm for drawing planar graphs on a grid, UCR-CS-90-2, Dept. of Math. and CS, UC at Riverside, 1990.

    Google Scholar 

  3. P. Eades and R. Tamassia, Algorithms for Automatic Graph Drawing: An Annotated Bibliography, Dept. of CS, Brown Univ., TR CS-89-09, 1989.

    Google Scholar 

  4. H. de Fraysseix, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990), pp. 41–51.

    Google Scholar 

  5. M. Fürer, Xin He, Ming-Yang Kao and B. Raghavachari, O(n log log n)-work parallel algorithm for straight-line grid embedding of planar graphs, in Proc. 4th ACM SPAA, San Diego, June 1992, pp. 100–109.

    Google Scholar 

  6. A. Goldberg, S. Plotkin, and G. Shannon, Parallel symmetry-breaking in sparse graphs, SIAM J. on Discrete Mathematics 1 (1988), pp. 434–446.

    Article  Google Scholar 

  7. M. Goldberg and T. Spencer, Constructing Maximal Independent Set in Parallel. SIAM J. Disc. Math. Vol 2(3), 1989, pp. 322–328.

    Article  Google Scholar 

  8. G. Kant, Drawing planar graphs using the lmc-ordering, in Proc. 33th IEEE FOCS, Pittsburgh, 1992, pp. 101–110.

    Google Scholar 

  9. G. Miller and J. Reif, Parallel tree contractions and its applications, in Proc. 26th IEEE FOCS, 1985, pp. 478–489.

    Google Scholar 

  10. V. Ramachandran and J. H. Reif, An optimal parallel algorithm for graph planarity, in Proc. 30th IEEE FOCS, 1989, pp. 282–287.

    Google Scholar 

  11. R. Read, A new method for drawing a planar graph given the cyclic order of the edges at each vertex, Congressus Numerantium 56 (1987), pp. 31–44.

    Google Scholar 

  12. W. Schnyder, Planar graphs and poset dimension, Orders 5 (1989), pp. 323–343.

    Article  Google Scholar 

  13. -, Embedding planar graphs on the grid, in Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 138–148.

    Google Scholar 

  14. R. Tamassia and J. S. Vitter, Parallel transitive closure and point location in planar structures, SIAM J. Comput. 20 (2), 1991, pp. 708–725.

    Article  Google Scholar 

  15. W. Tutte, How to draw a graph, London Math. Soc. 13, 1963, pp. 743–768.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, State University of New York at Buffalo, 14260, Buffalo, NY

    Xin He

  2. Department of Computer Science, Duke University, 27706, Durham, NC

    Ming-Yang Kao

Authors
  1. Xin He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ming-Yang Kao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

He, X., Kao, MY. (1993). Parallel construction of canonical ordering and convex drawing of triconnected planar graphs. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_261

Download citation

  • DOI: https://doi.org/10.1007/3-540-57568-5_261

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48233-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation