Skip to main content
SpringerLink
Log in

Path Separability of Graphs

  • Conference paper
Frontiers in Algorithmics (FAW 2010)

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

Included in the following conference series:

Abstract

In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several graph families having such path separability, and we show that this property is closed under minor taking. In particular we establish a list of forbidden minors for 1-path separable graphs.

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. Abraham, I., Gavoille, C.: Object location using path separators. In: 25th Annual ACM Symp. on Principles of Distributed Comp. (PODC), pp. 188–197 (2006)

    Google Scholar 

  2. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: Theory and experiments. In: 6th Workshop ALENEX, pp. 62–69 (2004)

    Google Scholar 

  3. Chepoi, V.D., Dragan, F.F., Estellon, B., Habib, M., Vaxès, Y.: Diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. In: 24st Annual ACM Symposium on Computational Geometry (SoCG), pp. 59–68 (2008)

    Google Scholar 

  4. Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discrete Mathematics 307(16), 2008–2029 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Flum, J., Grohe, M.: Parametrized Complexity Theory. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  6. Koster, A.M.C.A., Bodlaender, H.L., van Hoesel, S.P.M.: Treewidth: Computational experiments. In: Elsevier (ed.) 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, vol. 8, pp. 54–57. ENDM, Amsterdam (2001)

    Google Scholar 

  7. Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics 36(2), 177–189 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  8. Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B 63(1), 65–110 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  9. Robertson, N., Seymour, P.D.: Graph minors. XVI. Excluding a non-planar graph. Journal of Combinatorial Theory, Series B 89(1), 43–76 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner’s conjecture. Journal of Combinatorial Theory, Series B 92(2), 325–357 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. Journal of the ACM 51(6), 993–1024 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Umezawa, K., Yamazaki, K.: Tree-length equals branch-length. Discrete Mathematics 309(13), 4656–4660 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Université de Bordeaux, France

    Emilie Diot & Cyril Gavoille

Authors
  1. Emilie Diot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cyril Gavoille
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Academia Sinica, Institute of Information Science 20, Section 2, 128 Academia Road, Nankang, 11529, Taipei, Taiwan

    Der-Tsai Lee

  2. Department of Computer Science and Engineering, University of Notre Dame, 46556, Notre Dame, IN, USA

    Danny Z. Chen

  3. State Key Laboratory of Software Engineering, Wuhan University, 430072, Wuhan, Hubei, China

    Shi Ying

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Diot, E., Gavoille, C. (2010). Path Separability of Graphs. In: Lee, DT., Chen, D.Z., Ying, S. (eds) Frontiers in Algorithmics. FAW 2010. Lecture Notes in Computer Science, vol 6213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14553-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14553-7_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14552-0

  • Online ISBN: 978-3-642-14553-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation