Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2010: Computing and Combinatorics pp 110–119Cite as

Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph

  • Conference paper

  • 907 Accesses

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

Abstract

We show how to compute a maximum upward planar single-source subgraph of a single-source embedded DAG G φ . We first show that finding a maximum upward planar subgraph of a single-source embedded digraph is NP-complete. We then give a new characterization of upward planar single-source digraphs. We use this characterization to present an algorithm that computes a maximum upward planar single-source subgraph of a single-source embedded DAG. This algorithm takes O(n 4) time in the worst case and O(n 3) time on average.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abbasi, S., Healy, P., Rextin, A.: An improved upward planarity testing algorithm and related applications. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 334–344. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Bertolazzi, P., Battista, G.D., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 12(6), 476–497 (1994)

    Article  MathSciNet  Google Scholar 

  3. Bertolazzi, P., Battista, G.D., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27(1), 132–169 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Binucci, C., Didimo, W., Giordano, F.: On the complexity of finding maximum upward planar subgraph of an embedded planar digraph. Technical Report RT001-07, University of Perugia (Febuary 2007)

    Google Scholar 

  5. Binucci, C., Didimo, W., Giordano, F.: Maximum upward planar subgraphs of embedded planar digraphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Binucci, C., Didimo, W., Giordano, F.: Maximum upward planar subgraphs of embedded planar digraphs. Computational Geometry: Theory and Applications 41(3), 230–246 (2008)

    MATH  MathSciNet  Google Scholar 

  7. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)

    MATH  Google Scholar 

  8. Didimo, W.: Computing upward planar drawings using switch-regularity heuristics. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 117–126. Springer, Heidelberg (2005)

    Google Scholar 

  9. Didimo, W., Giordano, F., Liotta, G.: Upward spirality and upward planarity testing. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 117–128. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Hutton, M.D., Lubiw, A.: Upward planar drawing of singlesource acyclic digraphs. SIAM J. Comput. 25(2), 291–311 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  12. Hutton, M.: Upward planar drawing of single source acyclic digraphs. Master’s thesis, University of Waterloo (1990)

    Google Scholar 

  13. Papakostas, A.: Upward planarity testing of outerplanar DAGs. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 298–306. Springer, Heidelberg (1995)

    Google Scholar 

  14. Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics 1, 109–125 (1981)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. institute Department of Computing, National University of Science Technology, Pakistan

    Aimal Rextin

  2. Computer Science Department, University of Limerick, Ireland

    Patrick Healy

Authors
  1. Aimal Rextin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrick Healy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Florida, CSE Building, Room 566, P.O. Box 116120, 32611-6120, Gainesville, Florida, USA

    My T. Thai

  2. Department of Computer and Information Science and Technology, University of Florida, P.O. Box, USA

    Sartaj Sahni

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rextin, A., Healy, P. (2010). Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph. In: Thai, M.T., Sahni, S. (eds) Computing and Combinatorics. COCOON 2010. Lecture Notes in Computer Science, vol 6196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14031-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14031-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14030-3

  • Online ISBN: 978-3-642-14031-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation