Results 121 to 130 of about 5,081 (203)
Approximation algorithms for treewidth
, 2002 . This paper presents algorithms whose input is an undirected graph, and whose output is a tree decomposition of width that approximates the optimal, the treewidth of that graph.
Eyal Amir
core
Weighted Treewidth: Algorithmic Techniques and Results [PDF]
, 2006 From the analysis of algorithms for probabilistic networks, it is known that a tree decomposition of the minimum treewidth may not be optimal for these algorithms.
Emgad Bachoore +3 more
core +1 more source
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. [PDF]
Algorithmica, 2022 Gąsieniec L, Klasing R, Radzik T.
europepmc +1 more source
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. A lot of problems, which are in general $NP$-complete, can be solved in polynomial time for graphs with small treewidth.
Bronner, Daniela, Ries, Bernard
core
Safe separators for treewidth [PDF]
, 2003 www.cs.uu.nl Safe separators for treewidth
Hans L. Bodlaender +3 more
core +1 more source
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. [PDF]
Algorithmica, 2021 Ganian R, Ordyniak S.
europepmc +1 more source
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. [PDF]
Theory Comput Syst, 2021 Mengel S, Skritek S.
europepmc +1 more source
Connected Treewidth and Connected Graph Searching
, 2006 International audienceWe give a constructive proof of the equality between \emph{treewidth} and \emph{connected treewidth}. More precisely, we describe an $O(nk^3)$-time algorithm that, given any $n$-node width-$k$ tree-decomposition of a connected graph
Fraigniaud, Pierre, Nisse, Nicolas
core +1 more source
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. [PDF]
Algorithmica, 2021 Novotná J +5 more
europepmc +1 more source
An Algorithmic Treatment of Causal Unit Selection. [PDF]
Entropy (Basel)Huang H, Darwiche A.
europepmc +1 more source