Abstract
We give an algorithm for computing the directed pathwidth of a digraph with n vertices in \(O(1.89^{n})\) time. This is the first algorithm with running time better than the straightforward \(O^{*}(2^n)\). As a special case, it computes the pathwidth of an undirected graph in the same amount of time, improving on the algorithm due to Suchan and Villanger which runs in \(O(1.9657^n)\) time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barát, J.: Directed path-width and monotonicity in digraph searching. Gr. Comb. 22(2), 161–172 (2006)
Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11(1–2), 1–23 (1993)
Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)
Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D., Thilikos, D.: A note on exact algorithms for vertex ordering problems on graphs. Theory Comput. Syst. 50(3), 420–432 (2012)
Bodlaender, H.L., Kloks, T., Kratsch, D.: Treewidth and pathwidth of permutation graphs. SIAM J. Discrete Math. 8(4), 606–616 (1995)
Bodlaender, H.L., Möhring, R.H.: The pathwidth and treewidth of cographs. SIAM J. Discrete Math. 6(2), 181–188 (1992)
Coudert, D., Mazauric, D., Nisse, N.: Experimental evaluation of a branch and bound algorithm for computing pathwidth. In: Proceedings of the 13th International Symposium on Experimental Algorithms (SEA2014), Lecture Notes in Computer Science, vol. 8504, pp. 46–58 (2014)
Fomin, F.V., Giannopoulou, A.C., Pilipczuk, P.: Computing tree-depth faster than \(2^n\). In: Proceedings of the 8th International Symposium on Parameterized and Exact Computation (IPEC2013), Lecture Notes in Computer Sciencs, vol. 8246, pp. 137–149 (2013)
Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Berlin (2010)
Fomin, F.V., Villanger, Y.: Finding induced subgraphs via minimal triangulations. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Sciencs (STACS2010), Leibniz International Proceedings in Informatics, vol. 5, pp. 383–394 (2010)
Gusted, J.: On the pathwidth of chordal graphs. Discrete Appl. Math. 45(3), 233–248 (1993)
Habib, M., Möhring, R.H.: Treewidth of cocomparability graphs and a new order-theoretic parameter. Order 11(1), 44–60 (1994)
Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed tree-width. J. Comb. Theory Ser. B 82(1), 138–154 (2001)
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: Proceedings of International Symposium on Circuits and Systems, pp. 657–660 (1979)
Kinnersley, G.N.: The vertex separation number of a graph equals its path-width. Inf. Process. Lett. 42(6), 345–350 (1992)
Kitsunai, K., Kobayashi, Y., Komuro, K., Tamaki, H., Tano, T.: Computing directed pathwidth in \(O(1.89^n)\) time. In: Proceedings of the 7th International Symposium on Parameterized and Exact Computation (IPEC2012), Lecture Notes in Computer Science, vol. 7535, pp. 182–193 (2012)
Kobayashi, Y., Komuro, K. Tamaki, H.: Search space reduction through commitments in pathwidth computation: An experimental study. In: Proceedings of the 13th International Symposium on Experimental Algorithms (SEA2014), Lecture Notes in Computer Science, vol. 8504, pp. 388–399 (2014)
Kloks, T., Bodlaender, H.L., Müller, H., Kratsch, D.: Computing treewidth and minimum fill-in: All you need are the minimal separators. In: Proceedings of the 1st Annual European Symposium on Algorithms (ESA1993), Lecture Notes in Computer Science, vol. 726, pp. 260–271 (1993)
Monien, B., Sudborough, I.H.: Min cut is NP-complete for edge weighted trees. Theor. Comput. Sci. 58(1–3), 209–229 (1988)
Nagamochi, H.: Linear layouts in submodular systems. In: Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC2012), Lecture Notes in Computer Science, vol. 7676 pp. 475–484 (2012)
Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. J. Comb. Theory Ser. B 35(1), 39–61 (1983)
Robertson, N., Seymour, P.D.: Graph minors XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63(1), 65–110 (1995)
Suchan, K., Todinca, I.: Pathwidth of circular-arc graphs. In: Proceedings of 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG2007), Lecture Notes in Computer Science, vol. 4769, pp. 258–269 (2007)
Suchan, K., Villanger, Y.: Computing pathwidth faster than \(2^n\). In: Proceedings of the 4th International Workshop on Parameterized and Exact Computation (IWPEC2009), Lecture Notes in Computer Science, vol. 5917, pp. 324–335 (2009)
Tamaki, H.: A polynomial time algorithm for bounded directed pathwidth. In: Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2011), Lecture Notes in Computer Science, vol. 6986, pp. 331–342 (2011)
Yang, B., Cao, Y.: Digraph searching, directed vertex separation and directed pathwidth. Discrete Appl. Math. 156(10), 1822–1837 (2008)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kitsunai, K., Kobayashi, Y., Komuro, K. et al. Computing Directed Pathwidth in \(O(1.89^{n})\) Time. Algorithmica 75, 138–157 (2016). https://doi.org/10.1007/s00453-015-0015-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-015-0015-9