Skip to main content
Springer Nature Link
Log in

2-connecting Outerplanar Graphs without Blowing Up the Pathwidth

  • Conference paper
Computing and Combinatorics (COCOON 2013)

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

Included in the following conference series:

Abstract

Given a connected outerplanar graph G with pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). As a consequence, we get a constant factor approximation algorithm to compute a straight line planar drawing of any outerplanar graph, with its vertices placed on a two dimensional grid of minimum height. This settles an open problem raised by Biedl [3].

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Babu, J., Basavaraju, M., Chandran, L.S., Rajendraprasad, D.: 2-connecting outerplanar graphs without blowing up the pathwidth. CoRR abs/1212.6382 (2012), http://arxiv.org/abs/1212.6382

  2. Biedl, T.: Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs. Discrete Comput. Geom. 45(1), 141–160 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  3. Biedl, T.: A 4-approximation for the height of 2-connected outer-planar graph drawings. In: WAOA 2012 (2012)

    Google Scholar 

  4. Chartrand, G., Harary, F.: Planar permutation graphs. Annales de l’institut Henri Poincaré (B) Probabilités et Statistiques 3, 433–438 (1967)

    MATH  MathSciNet  Google Scholar 

  5. Dujmovic, V., Morin, P., Wood, D.R.: Path-width and three-dimensional straight-line grid drawings of graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 42–53. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. García, A., Hurtado, F., Noy, M., Tejel, J.: Augmenting the connectivity of outerplanar graphs. Algorithmica 56(2), 160–179 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  7. Govindan, R., Langston, M.A., Yan, X.: Approximating the pathwidth of outerplanar graphs. Inf. Process. Lett. 68(1), 17–23 (1998)

    Article  MathSciNet  Google Scholar 

  8. Hopcroft, J., Tarjan, R.: Algorithm 447: Efficient algorithms for graph manipulation. Commun. ACM 16(6), 372–378 (1973)

    Article  Google Scholar 

  9. Kant, G.: Augmenting outerplanar graphs. Journal of Algorithms 21(1), 1–25 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. Robertson, N., Seymour, P.D.: Graph minors. iii. planar tree-width. J. Comb. Theory, Ser. B 36(1), 49–64 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  11. Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990, pp. 138–148 (1990)

    Google Scholar 

  12. Skodinis, K.: Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time. J. Algorithms 47(1), 40–59 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Suderman, M.: Pathwidth and layered drawings of trees. Int. J. Comput. Geometry Appl. 14(3), 203–225 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  14. Syslo, M.M.: Characterizations of outerplanar graphs. Discrete Mathematics 26(1), 47–53 (1979)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Science, Bangalore, 560012, India

    Jasine Babu, Sunil Chandran Leela & Deepak Rajendraprasad

  2. The Institute of Mathematical Sciences, Chennai, 600113, India

    Manu Basavaraju

Authors
  1. Jasine Babu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manu Basavaraju
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sunil Chandran Leela
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Deepak Rajendraprasad
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Ding-Zhu Du

  2. College of Computer Science and Technology, Zhejiang University, 310027, Hangzhou, China

    Guochuan Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Babu, J., Basavaraju, M., Chandran Leela, S., Rajendraprasad, D. (2013). 2-connecting Outerplanar Graphs without Blowing Up the Pathwidth. In: Du, DZ., Zhang, G. (eds) Computing and Combinatorics. COCOON 2013. Lecture Notes in Computer Science, vol 7936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38768-5_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38768-5_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38767-8

  • Online ISBN: 978-3-642-38768-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics