Branchwidth Dimitrios M. Thilikos Hans L. Bodlaender  Home/Search
Context
Related
| cs.uu.nl/research/techr...200038.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.uu.nl/research/techreps/...jvl (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth k and, if so, outputs a branch decomposition of minimum width. (Update)
Similar documents (at the sentence level):
32.3%: Constructive Linear Time Algorithms for Branchwidth - Thilikos, Bodlaender (1997) (Correct)
Active bibliography (related documents): More All
1.0: Algorithms and Obstructions for Linear-Width and Related Search.. - Thilikos (1997) (Correct)
0.3: Constructive Linear Time Algorithms for Branchwidth.. - Bodlaender, Thilikos (1997) (Correct)
0.3: Graphs with Branchwidth at most Three - Bodlaender, Thilikos (1997) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ thilikos-constructive,
author = "Branchwidth Dimitrios Thilikos",
title = "Constructive Linear Time Algorithms For",
url = "citeseer.ist.psu.edu/755747.html" }
Citations (may not include all citations):202 A linear time algorithm for finding tree-decompositions of s.. - Bodlaender - 1996
172 Complexity of finding embeddings in a k-tree (context) - Arnborg, Corneil et al. - 1987
109 Efficient algorithms for combinatorial problems on graphs wi.. (context) - Arnborg - 1985
97 A tourist guide through treewidth - Bodlaender - 1993
78 Graph minors --- a survey (context) - Robertson, Seymour - 1985
62 Obstructions to treedecomposition (context) - Robertson, Seymour - 1991
37 Call routing and the ratcatcher (context) - Seymour, Thomas - 1994
29 Efficient and constructive algorithms for the pathwidth and .. - Bodlaender, Kloks - 1996
28 The metamathematics of the graph minor theorem (context) - Friedman, Robertson et al. - 1987
24 Obstruction set isolation for the gate matrix layout problem - Kinnersley, Langston - 1994
22 Forbidden minors characterization of partial 3-trees (context) - Arnborg, Proskurowski et al. - 1990
20 Computing small search numbers in linear time - Bodlaender, Thilikos - 1998
19 Algorithms and obstructions for linear-width and related sea.. - Thilikos - 2000
16 Graphs with branchwidth at most three - Bodlaender, Thilikos - 1999
14 A characterization of partial 3-trees (context) - Satyanarayana, Tung - 1990
12 A constructive linear time algorithm for small cutwidth - Thilikos, Serna et al. - 2000
12 An algorithm for the ring-routing problem (context) - Cook, Seymour - 1993
12 Constructive linear time algorithms for small cutwidth and c.. - Thilikos, Serna et al. - 2000
11 tree in terms of certain substructures (context) - Kajitani, Ishizuka et al. - 1986
8 Minimal forbidden minors for the family of graphs with prope.. (context) - Takahashi, Ueno et al. - 1995
6 Obstruction Set Isolation for Layout Permutation Problems (context) - Kinnersley - 1989
5 and the efficiency of polynomial-time algorithms (context) - Fellows, Langston et al. - 1994
4 An efficient polynomial-time algorithm for three-track gate .. (context) - Kinnersley, Kinnersley - 1994
3 Personal Comunication (context) - Cook - 1996
Documents on the same site (http://www.cs.uu.nl/research/techreps/grp/jvl.html): More
Comparing Loop Cutsets and Clique Trees in Probabilistic.. - van der Gaag, Bodlaender (1997) (Correct)
Convex Recoloring of Leaf-Colored Trees - Bachoore, Bodlaender (2006) (Correct)
Linear Election for Oriented Hypercubes - Gerard Tel Department (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC