Computing Directed Pathwidth in O(1.89n) Time

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, i...

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 75; no. 1; pp. 138 - 157
Main Authors:	Kitsunai, Kenta, Kobayashi, Yasuaki, Komuro, Keita, Tamaki, Hisao, Tano, Toshihiro
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.05.2016
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Pathwidth Exact exponential algorithm Graph algorithm
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!