Pathwidth of cubic graphs and exact algorithms

We prove that for any ɛ > 0 there exists an integer n ɛ such that the pathwidth of every cubic (or 3-regular) graph on n > n ɛ vertices is at most ( 1 / 6 + ɛ ) n . Based on this bound we improve the worst case time analysis for a number of exact exponential algorithms on graphs of maximum ver...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information processing letters Ročník 97; číslo 5; s. 191 - 196
Hlavní autori: Fomin, Fedor V., Høie, Kjartan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 16.03.2006
Elsevier Science
Elsevier Sequoia S.A
Predmet:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Cubic graph
Exact exponential algorithm
Exact sciences and technology
Graph algorithms
Graph theory
Information retrieval. Graph
Mathematics
Max-cut
Maximum independent set
Minimum dominating set
Pathwidth
Sciences and techniques of general use
Studies
Theoretical computing
Treewidth
Cubic graph
Maximum independent set
Exact exponential algorithm
Graph algorithms
Pathwidth
Minimum dominating set
Treewidth
Max-cut
Dominating set
Computer theory
Vertex(graph)
Maximal cut
Tree width
Information processing
Graph degree
Independent set
Time analysis
Algorithm analysis
Graph algorithm
Regular graph
ISSN:0020-0190, 1872-6119
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We prove that for any ɛ > 0 there exists an integer n ɛ such that the pathwidth of every cubic (or 3-regular) graph on n > n ɛ vertices is at most ( 1 / 6 + ɛ ) n . Based on this bound we improve the worst case time analysis for a number of exact exponential algorithms on graphs of maximum vertex degree three.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2005.10.012