A Partial k-Arboretum of Graphs with Bounded Treewidth
نویسنده
چکیده
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.
منابع مشابه
Planar Graphs and Partial k-Trees
It is well-known that many NP-hard problems can be solved efficiently on graphs of bounded treewidth. We begin by showing that Knuth’s results on nested satisfiability are easily derived from this fact since nested satisfiability graphs have treewidth at most three. Noting that nested satisfiability graphs have a particular form of planar drawing, we define a more general form of graph drawing ...
متن کاملOn Bounded Treewidth Duality of Graphs J.ne Set Ril
We prove that for any integers m; k, there is an integer n 0 such that if G is a graph of girth n 0 then any partial k-tree homomorphic to G is also homomorphic to C 2m+1. As a corollary, every non-bipartite graph does not have bounded treewidth duality.
متن کاملOn the Number of Labeled Graphs of Bounded Treewidth
We focus on counting the number of labeled graphs on n vertices and treewidth at most k (or equivalently, the number of labeled partial k-trees), which we denote by Tn,k. So far, only the particular cases Tn,1 and Tn,2 had been studied. We show that
متن کاملDynamic Algorithms for Graphs with Treewidth 2
In this paper, we consider algorithms for maintaining tree-decompositions with constant bounded treewidth under edge and vertex insertions and deletions for graphs with treewidth at most 2 (also called: partial 2-trees, or series-parallel graphs), and for almost trees with parameter k. Each operation can be performed in O(log n) time. For a large number of graph decision, optimization and count...
متن کاملThe Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
Many combinatorial problems are NP-complete for general graphs, but are not NP-complete for partial k-trees (graphs of treewidth bounded by a constant k) and can be efficiently solved in polynomial time or mostly in linear time for partial k-trees. On the other hand, very few problems are known to be NP-complete for partial k-trees with bounded k. These include the subgraph isomorphism problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 209 شماره
صفحات -
تاریخ انتشار 1998