Tag: treewidth

Found 44 results for 'treewidth'.

1) graph-theory - What separates easy global problems from hard global problems on graphs of bounded treewidth?
2) cc.complexity-theory - Logspace algorithms on graphs with bounded tree width
3) cc.complexity-theory - Treewidth and the NL vs L Problem
4) graph-theory - Something-Treewidth Property
5) reference-request - Generalization of locally bounded treewidth graphs
6) graph-theory - Naive definition of treewidth
7) reference-request - Enumerating Planar Graphs of Bounded Treewidth
8) graph-theory - Does replacing each vertex of $G$ by $H$ increase treewidth of $G$ by at most $\Delta(G)$?
9) graph-theory - Tree width of a particular graph
10) circuit-complexity - What are bounded-treewidth circuits good for?
11) graph-algorithms - What's the correlation between treewidth and instance hardness for random 3-SAT?
12) graph-algorithms - Exact Algorithms for r-Dominating Set on Bounded Treewidth Graphs
13) cc.complexity-theory - Is bounded-width SAT decidable in logspace?
14) graph-theory - Tree decompositions of optimal width where every vertex is in a bounded number of bags?
15) cc.complexity-theory - TSP in bounded tree-width (or bounded branch width) graphs
16) reference-request - Is counting simple cycles in $P$ for graphs of bounded tree width?
17) graph-theory - MSO properties, planar graphs and minor-free graphs
18) cc.complexity-theory - Complexity of testing if a hypergraph has generalized hypertreewidth $2$
19) reference-request - Is it still open to determine the complexity of computing the treewidth of planar graphs?
20) graph-theory - Forbidden minors for bounded treewidth graphs
21) graph-theory - Classes of graphs with superconstant treewidth
22) co.combinatorics - Finding subgraphs with high treewidth and constant degree
23) reference-request - Tree-decomposition with clique interfaces
24) ds.algorithms - Making a minimum-width tree decomposition lean in polynomial time
25) graph-theory - Relation between tree-width and clique number
26) graph-theory - The origin of the notion of treewidth
27) reference-request - Maximum Treewidth of a Graphs with $m$ Edges
28) ds.algorithms - Special cases of Graphic TSP
29) cc.complexity-theory - CSPs with unbounded fractional hypertree width
30) graph-theory - Does treewidth $k$ imply the existence of a $K_{1,k}$ minor?
31) graph-theory - Ensemble of tree decompositions for all-pairs problem
32) cc.complexity-theory - Is there any problem in $\mathsf{\Sigma^P_2}$ which is solvable in bounded tree width graphs?
33) parameterized-complexity - Parameterized complexity of tree/branch decomposition
34) treewidth - When is hypertree width more useful than generalized hypertree width?
35) ds.algorithms - Tree decomposition for planar graphs
36) treewidth - Treewidth of deep Sierpiński Sieve Graph
37) graph-theory - Natural (well studied) classes of graphs with treewidth $\Theta(n^\alpha)$ with $1/2 < \alpha < 1$
38) cc.complexity-theory - Nontrivial Algorithms for Coloring (Parameterized by Pathwidth)
39) sat - Complexity of SAT parameterized by treewidth
40) graph-algorithms - Does distance-2 coloring fit in Telle and Proskurowski 's algorithm for partial-k trees?
41) reference-request - What is the pathwidth of the 3D-grid (mesh or lattice) with sidelength k?
42) ds.algorithms - Fast treewidth algorithms
43) ds.algorithms - Typical hardness of tree decomposition?
44) cc.complexity-theory - Treewidth relations between Boolean formulas and Tseitin encodings