Results 181 to 190 of about 5,081 (203)
Some of the next articles are maybe not open access.
Experimental Analysis of Treewidth
2020The goal of this chapter is to provide insights into treewidth obtained from experiments. In our experiments, we count the numbers of combinatorial objects closely related to treewidth in random graph instances. These combinatorial objects include connected sets, minimal separators, potential maximal cliques, and those with certain constraints.
openaire +2 more sources
Treewidth of Products of Graphs with High Treewidth
Treewidth is the standard measure for how ``tree-like'' a graph is. This paper studies how the treewidth of a product graph depends on the treewidth of its factors. Kozawa, Otachi, and Yamazaki [2014] and Hickingbotham and Wood [2025] independently showed that $\text{tw}(G\boxtimes H)\geq (\text{tw}(G)+1)\text{had}(H)-1$ for all graphs $G$ and $H ...openaire +1 more source
Treewidth: Structure and Algorithms
2007This paper surveys some aspects of the graph theoretic notion of treewidth. In particular, we look at the interaction between different characterizations of the notion, and algorithms and algorithmic applications.
openaire +3 more sources
A partial -arboretum of graphs with bounded treewidth
Theoretical Computer Science, 1998Hans L. Bodlaender
exaly
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing, 1996Hans L. Bodlaender
exaly
A ckn 5-Approximation Algorithm for Treewidth
SIAM Journal on Computing, 2016Michal Pilipczuk +2 more
exaly
On the Relationship Between Clique-Width and Treewidth
SIAM Journal on Computing, 2005Udi Rotics, Derek Corneil
exaly
Treewidth computations I. Upper bounds
Information and Computation, 2010Arie M.C.A. Koster, Hans L. Bodlaender
exaly