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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithmica Ročník 75; číslo 1; s. 138 - 157
Hlavní autoři: Kitsunai, Kenta, Kobayashi, Yasuaki, Komuro, Keita, Tamaki, Hisao, Tano, Toshihiro
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.05.2016
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-015-0015-9