### 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(mn ^{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.

Original language | English |
---|---|

Title of host publication | Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Revised Papers |

Pages | 331-342 |

Number of pages | 12 |

DOIs | |

Publication status | Published - 1 Dec 2011 |

Event | 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011 - Tepla Monastery, Czech Republic Duration: 21 Jun 2011 → 24 Jun 2011 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 6986 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011 |
---|---|

Country | Czech Republic |

City | Tepla Monastery |

Period | 21/06/11 → 24/06/11 |

## Fingerprint Dive into the research topics of 'A polynomial time algorithm for bounded directed pathwidth'. Together they form a unique fingerprint.

## Cite this

Tamaki, H. (2011). A polynomial time algorithm for bounded directed pathwidth. In

*Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Revised Papers*(pp. 331-342). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6986 LNCS). https://doi.org/10.1007/978-3-642-25870-1_30