Results 11 to 20 of about 13,679 (262)
A note on domino treewidth [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 In [DO95], Ding and Oporowski proved that for every k, and d, there exists a constant c_k,d, such that every graph with treewidth at most k and maximum degree at most d has domino treewidth at most c_k,d.
Hans L. Bodlaender
doaj +8 more sources
An Improved Parameterized Algorithm for Treewidth [PDF]
SIAM Journal on Computing, 2023 57 pages, 2 figures. STOC 2023.
Tuukka Korhonen, Daniel Lokshtanov
openaire +3 more sources
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023 80 pages, 2 ...
Korhonen, Tuukka +4 more
openaire +3 more sources
Embedding phylogenetic trees in networks of low treewidth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Given a rooted, binary phylogenetic network and a rooted, binary phylogenetic tree, can the tree be embedded into the network? This problem, called \textsc{Tree Containment}, arises when validating networks constructed by phylogenetic inference methods ...
Leo van Iersel +2 more
doaj +3 more sources
On Sparsification for Computing Treewidth [PDF]
Algorithmica, 2013 We investigate whether an n-vertex instance (G,k) of Treewidth, asking whether the graph G has treewidth at most k, can efficiently be made sparse without changing its answer.
C.-K. Yap +13 more
core +7 more sources
Nordhaus-Gaddum for Treewidth [PDF]
European Journal of Combinatorics, 2011 We prove that for every graph $G$ with $n$ vertices, the treewidth of $G$ plus the treewidth of the complement of $G$ is at least $n-2$.
Bodlaender +12 more
core +4 more sources
Treewidth: Computational Experiments [PDF]
Electronic Notes in Discrete Mathematics, 2001 Many {\cal NP}-hard graph problems can be solved in polynomial time for graphs with bounded treewidth. Equivalent results are known for pathwidth and branchwidth. In recent years, several studies have shown that this result is not only of theoretical interest but can successfully be applied to find (almost) optimal solutions or lower bounds for diverse
Arie M. C. A. Koster +2 more
openalex +12 more sources
Journal of Combinatorial Theory, Series B, 2005 AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we show that if G has girth at least g and average degree at least d, then tw(G)=Ω(1g+1(d−1)⌊(g−1)/2⌋). In view of a famous conjecture regarding the existence of graphs with girth g, minimum degree δ and having at most c(δ−1)⌊(g−1)/2⌋ vertices (for some ...
L. Sunil Chandran, C. R. Subramanian
openalex +3 more sources
An Algorithmic Metatheorem for Directed Treewidth [PDF]
Discrete Applied Mathematics, 2015 The notion of directed treewidth was introduced by Johnson, Robertson, Seymour and Thomas [Journal of Combinatorial Theory, Series B, Vol 82, 2001] as a first step towards an algorithmic metatheory for digraphs.
Oliveira, Mateus de Oliveira
core +5 more sources
Journal of Combinatorial Theory, Series B, 2005 25 ...
L. Sunil Chandran, Naveen Sivadasan
openalex +5 more sources