Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph-Theoretic Concepts in Computer Science

WG 2011: Graph-Theoretic Concepts in Computer Science pp 331–342Cite as

A Polynomial Time Algorithm for Bounded Directed Pathwidth

  • Conference paper

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

Abstract

We give a polynomial time algorithm for bounded directed pathwidth. Given a positive integer k and a digraph G with n vertices and m edges, it runs in O(m n k + 1) time and constructs a directed path-decomposition of G of width at most k if one exists and otherwise reports the non-existence.

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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM Journal on Matrix Analysis and Applications 8(2), 277–284

    Google Scholar 

  2. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Mathematics 23(1), 11–24

    Google Scholar 

  3. Barát, J.: Directed path-width and monotonicity in digraph searching. Graphs and Combinatorics 22(2), 161–172 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Berwanger, D., Dawar, A., Hunter, P., Kreutzer, S.: DAG-Width and Parity Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 524–536. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of Graphs. Journal of Algorithms 21, 358–402 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25(6), 1305–1317 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  8. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  9. Ganian, R., Hliněný, P., Kneis, J., Langer, A., Obdržálek, J., Rossmanith, P.: On Digraph Width Measures in Parameterized Algorithmics. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 185–197. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Hunter, P., Kreutzer, S.: Digraph Measures: Kelly Decompositions, Games, and Orderings. In: Proc. the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 637–644 (2007)

    Google Scholar 

  11. Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed tree-width. Journal of Combinatorial Theory Series B 82(1), 138–154 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kashiwabara, T., Fujisawa, T.: NP-completeness of the problem of finding a minimum-clique-number interval graph containing a given graph as a subgraph. In: Proc. International Symposium on Circuits and Systems, pp. 657–660 (1979)

    Google Scholar 

  13. Kinnersley, N.G.: The vertex separation number of a graph equals its path-width. Information Processing Letters 42, 345–350 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lampis, M., Kaouri, G., Mitsou, V.: On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures. In: Proc. of 19th International Symposium on Algorithms and Computation, pp. 220–231 (2008)

    Google Scholar 

  15. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)

    Google Scholar 

  16. Obdržálek, J.: DAG-width - Connectivity Measure for Directed Graphs. In: Proc. the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 814–821 (2006)

    Google Scholar 

  17. Robertson, N., Seymour, P.: Graph minors. I. Excluding a forest. Journal of Combinatorial Theory, Series B 35(1), 39–61 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  18. Robertson, N., Seymour, P.: Graph minors III: Planar tree-width. Journal of Combinatorial Theory, Series B 36(1), 49–64 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  19. Robertson, N., Seymour, P.: Graph Minors. XX. Wagner’s conjecture. Journal of Combinatorial Theory, Series B 92(2), 325–335 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  20. Safari, M.A.: D-Width: A More Natural Measure for Directed Tree Width. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 745–756. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  21. Tamaki, H.: A directed path-decomposition approach to exactly identifying attractors of boolean networks. In: Proc. 10th International Symposium on Communications and Information Technologies, pp. 844–849 (2010)

    Google Scholar 

  22. Yang, B., Cao, Y.: Digraph searching, directed vertex separation and directed pathwidth. Discrete Applied Mathematics 156(10), 1822–1837 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Meiji University, Kawasaki, 214-8571, Japan

    Hisao Tamaki

Authors
  1. Hisao Tamaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. KAM MFF UK, Charles University, Malostranské nám 25, 11800, Praha 1, Czech Republic

    Petr Kolman  & Jan Kratochvíl  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tamaki, H. (2011). A Polynomial Time Algorithm for Bounded Directed Pathwidth. In: Kolman, P., Kratochvíl, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 2011. Lecture Notes in Computer Science, vol 6986. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25870-1_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25870-1_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25869-5

  • Online ISBN: 978-3-642-25870-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation