Skip to main content
SpringerLink
Log in

The Duals of Upward Planar Graphs on Cylinders

  • Conference paper
Book cover Graph-Theoretic Concepts in Computer Science (WG 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7551))

Included in the following conference series:

Abstract

We consider directed planar graphs with an upward planar drawing on the rolling and standing cylinders. These classes extend the upward planar graphs in the plane. Here, we address the dual graphs. Our main result is a combinatorial characterization of these sets of upward planar graphs. It basically shows that the roles of the standing and the rolling cylinders are interchanged for their duals.

Supported by the Deutsche Forschungsgemeinschaft (DFG), grant Br835/15-2.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Auer, C., Bachmaier, C., Brandenburg, F.J., Gleißner, A., Hanauer, K.: The duals of upward planar graphs on cylinders. Tech. Rep. MIP-1204, Faculty of Informatics and Mathematics, University of Passau (2012), http://www.fim.uni-passau.de/en/research/forschungsberichte/mip-1204.html

  2. Auer, C., Bachmaier, C., Brandenburg, F.J., Gleißner, A.: Classification of Planar Upward Embedding. In: Speckmann, B. (ed.) GD 2011. LNCS, vol. 7034, pp. 415–426. Springer, Heidelberg (2011)

    Google Scholar 

  3. Bachmaier, C.: A radial adaption of the Sugiyama framework for visualizing hierarchical information. IEEE Trans. Vis. Comput. Graphics 13(3), 583–594 (2007)

    Article  MathSciNet  Google Scholar 

  4. Bachmaier, C., Brandenburg, F.J., Brunner, W., Fülöp, R.: Drawing recurrent hierarchies. J. Graph Alg. App. 16(2), 151–198 (2012)

    Article  Google Scholar 

  5. Bang-Jensen, J., Cutin, G.: Digraphs: Theory, Algorithms and Applications, 1st edn. Springer (2000)

    Google Scholar 

  6. Bertolazzi, P., Di Battista, G., Didimo, W.: Quasi-upward planarity. Algorithmica 32(3), 474–506 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Brandenburg, F.J.: On the curve complexity of upward planar drawings. In: Mestre, J. (ed.) Computing: The Australasian Theory Symposium, CATS 2012. Conferences in Research and Practice in Information Technology (CRPIT), vol. 128, pp. 27–36. Australian Computer Society, ACS (2012)

    Google Scholar 

  8. Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61(2-3), 175–198 (1988)

    Article  MATH  Google Scholar 

  9. Dolati, A.: Digraph embedding on t h . In: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2008, pp. 11–14 (2008)

    Google Scholar 

  10. Dolati, A., Hashemi, S.M.: On the sphericity testing of single source digraphs. Discrete Math. 308(11), 2175–2181 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Dolati, A., Hashemi, S.M., Kosravani, M.: On the upward embedding on the torus. Rocky Mt. J. Math. 38(1), 107–121 (2008)

    Article  MATH  Google Scholar 

  12. Foldes, S., Rival, I., Urrutia, J.: Light sources, obstructions and spherical orders. Discrete Math. 102(1), 13–23 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  13. Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601–625 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hansen, K.A.: Constant width planar computation characterizes ACC0. Theor. Comput. Sci. 39(1), 79–92 (2006)

    Article  MATH  Google Scholar 

  15. Hashemi, S.M., Rival, I., Kisielewicz, A.: The complexity of upward drawings on spheres. Order 14, 327–363 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  16. Hashemi, S.M.: Digraph embedding. Discrete Math. 233(1-3), 321–328 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol. 2025. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  18. Kelly, D.: Fundamentals of planar ordered sets. Discrete Math. 63, 197–216 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  19. Limaye, N., Mahajan, M., Sarma, J.M.N.: Evaluating Monotone Circuits on Cylinders, Planes and Tori. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 660–671. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  20. Limaye, N., Mahajan, M., Sarma, J.M.N.: Upper bounds for monotone planar circuit value and variants. Comput. Complex. 18(3), 377–412 (2009)

    Article  MATH  Google Scholar 

  21. Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst., Man, Cybern. 11(2), 109–125 (1981)

    Article  MathSciNet  Google Scholar 

  22. Thomassen, C.: Planar acyclic oriented graphs. Order 5(1), 349–361 (1989)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Passau, Germany

    Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner & Kathrin Hanauer

Authors
  1. Christopher Auer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Bachmaier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Franz J. Brandenburg
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Andreas Gleißner
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kathrin Hanauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Caesarea Rothschild Institute (CRI), 31905, Haifa, Israel

    Martin Charles Golumbic

  2. The Academic College of Tel Aviv, Unit of Statistics and Probability Studies, 64044, Yaffo, Israel

    Michal Stern

  3. Shenkar College and Caesarea Rothschild Institute (CRI), University of Haifa, 31905, Haifa, Israel

    Avivit Levy

  4. Caesarea Rothschild Institute (CRI), 31905, Haifa, Israel

    Gila Morgenstern

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Auer, C., Bachmaier, C., Brandenburg, F.J., Gleißner, A., Hanauer, K. (2012). The Duals of Upward Planar Graphs on Cylinders. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 2012. Lecture Notes in Computer Science, vol 7551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34611-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34611-8_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34610-1

  • Online ISBN: 978-3-642-34611-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation