Approximating the pathwidth of outerplanar graphs

Approximating the pathwidth of outerplanar graphs

Pathwidth is a well-known NP-complete graph metric. We present a technique to approximate the pathwidth of outerplanar graphs. Although a polynomial-time algorithm is already known to determine the pathwidth of outerplanar graphs, this algorithm is not practical. Our algorithm works in O( n log n) t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1998-10, Vol.68 (1), p.17-23
Hauptverfasser: Govindan, Rajeev, Langston, Michael A., Yan, Xudong
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Approximation
Computer science
control theory
systems
Exact sciences and technology
Graphs
Information processing
Information retrieval. Graph
Outerplanar graphs
Pathwidth
Studies
Theoretical computing
Tree decomposition
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Pathwidth is a well-known NP-complete graph metric. We present a technique to approximate the pathwidth of outerplanar graphs. Although a polynomial-time algorithm is already known to determine the pathwidth of outerplanar graphs, this algorithm is not practical. Our algorithm works in O( n log n) time on graphs of order n, is practical and produces solutions at most three times the optimum.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(98)00139-2