Skip to main content
SpringerLink
Log in
Book cover

Italian Conference on Algorithms and Complexity

CIAC 1997: Algorithms and Complexity pp 122–134Cite as

Nice drawings for planar bipartite graphs

  • Regular Presentations
  • Conference paper
  • First Online:

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

Abstract

Graph drawing algorithms usually attempt to display the characteristic properties of the input graphs. In this paper we consider the class of planar bipartite graphs and try to achieve planar drawings such that the bipartiteness property is cleary shown. To this aim, we develop several models, give efficient algorithms to find a corresponding drawing if possible or prove the hardness of the problem.

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. Di Battista G., P. Eades, R. Tamassia and I.G. Tollis, ‘Algorithms for Drawing Graphs: an Annotated Bibliography', Computational Geometry: Theory & Applications, (1994), pp. 235–282.

    Google Scholar 

  2. Di Battista G., W.-P. Liu and I. Rival, ‘Bipartite graphs, upward drawings, and planarity', Information Processing Letters, 36 (1990), pp. 317–322.

    Google Scholar 

  3. Eades P., ‘A heuristic for graph drawing', Congr. Numerant., (1984), pp. 149–160.

    Google Scholar 

  4. Eades P., B.D. McKay and N. Wormald, ‘On an edge crossing problem', Proc. Australian Computer Science Conf., Austr. Nat. Univ. (1986), pp. 327–334.

    Google Scholar 

  5. Eades P. and N. Wormald, ‘The Median Heuristic for Drawing 2-layered Networks', Technical Report 69, Dept. of Comp. Science, Univ. of Queensland, 1986.

    Google Scholar 

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

    Google Scholar 

  7. Garey, M.R. and D.S. Johnson, ‘Crossing Number is NP-complete', SIAM J. Algebraic and Discrete Methods, 4(3) (1983), pp. 312–316.

    Google Scholar 

  8. Garey, M.R., D.S. Johnson and R.E. Tarjan, ‘The Planar Hamiltonian Circuit Problem is NP-complete', SIAM J. Comput. 5 (1976), pp. 704–714.

    Google Scholar 

  9. Jünger M. and P. Mutzel, 'Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization', Proc. Graph Drawing, (1995), LNCS 1027, pp. 337–349.

    Google Scholar 

  10. Mitchell S.L. ‘Linear algorithms to recognize outerplanar and maximal outplanar graphs', Information Processing Letters 9 (1979), pp. 229–232.

    Google Scholar 

  11. Kamada T. and S. Kawai, ‘An algorithm for drawing general undirected graphs', Information Processing Letters, 31 (1989), pp. 70–15.

    Google Scholar 

  12. Sugiyama K., S. Tagawa and M. Toda, ‘Methods for visual understanding of hierarchical Systems', IEEE Trans. on Systems, Man and Cybern., 11 (1981), pp.109–125.

    Google Scholar 

  13. Tomii, N., Y. Kambayashi, and Y. Shuzo, ‘On Planarization Algorithms of 2-Level Graphs', Papers of tech. group on elect. comp., IECEJ, EC77-38 (1977), pp. 1–12.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, 72076, Tübingen, Germany

    Ulrich Fößmeier & Michael Kaufmann

Authors
  1. Ulrich Fößmeier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Kaufmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giancarlo Bongiovanni Daniel Pierre Bovet Giuseppe Di Battista

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fößmeier, U., Kaufmann, M. (1997). Nice drawings for planar bipartite graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds) Algorithms and Complexity. CIAC 1997. Lecture Notes in Computer Science, vol 1203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62592-5_66

Download citation

  • DOI: https://doi.org/10.1007/3-540-62592-5_66

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62592-6

  • Online ISBN: 978-3-540-68323-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation