A polynomial time algorithm for bounded directed pathwidth

Authors:
Hisao Tamaki
Affiliations:
Department of Computer Science, Meiji University, Kawasaki, Japan
Venue:
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Year:
2011

Citing 16
Cited 2

Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Linear time algorithms for NP-hard problems restricted to partial k-trees

Discrete Applied Mathematics
The vertex separation number of a graph equals its path-width

Information Processing Letters
Efficient and constructive algorithms for the pathwidth and treewidth of graphs

Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Directed tree-width

Journal of Combinatorial Theory Series B
Graph Minors. XX. Wagner's conjecture

Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
DAG-width: connectivity measure for directed graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Digraph measures: Kelly decompositions, games, and orderings

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Digraph searching, directed vertex separation and directed pathwidth

Discrete Applied Mathematics
On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
On Digraph Width Measures in Parameterized Algorithmics

Parameterized and Exact Computation
DAG-Width and parity games

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
D-Width: a more natural measure for directed tree width

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Parameterized Complexity

Parameterized Complexity

Submodular minimization via pathwidth

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Computing directed pathwidth in O(1.89n) time

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation

Quantified Score

Hi-index	0.00

Visualization

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(mnk+1) time and constructs a directed path-decomposition of G of width at most k if one exists and otherwise reports the non-existence.