Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

34

TCS
1998

favoriteEmaildiscussreport

103views Theoretical Computer Science» more TCS 1998»

A Partial k-Arboretum of Graphs with Bounded Treewidth

13 years 10 months ago

A Partial k-Arboretum of Graphs with Bounded Treewidth

Download igitur-archive.library.uu.nl

The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class. Also, some mutual relations between such classes are discussed.

Hans L. Bodlaender

Real-time Traffic

Graph Algorithmic Studies | Powerful Vehicle | TCS 1998 | Theoretical Computer Science | Uniform Upper Bound |

claim paper

Related Content

» Partitioning a graph of bounded treewidth to connected subgraphs of almost uniform size

» Algorithms for Finding DistanceEdgeColorings of Graphs

» Parity Games with Partial Information Played on Graphs of Bounded Complexity

» Contraction and Treewidth Lower Bounds

» Graph Treewidth and Geometric Thickness Parameters

» Algorithmic Lower Bounds for Problems Parameterized by Cliquewidth

» Connected Coloring Completion for General Graphs Algorithms and Complexity

» Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size

» Partitioning graphs of supply and demand

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	TCS
Authors	Hans L. Bodlaender

Comments (0)