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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 75; H. 1; S. 138 - 157
Hauptverfasser:	Kitsunai, Kenta, Kobayashi, Yasuaki, Komuro, Keita, Tamaki, Hisao, Tano, Toshihiro
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.05.2016
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!