Results 231 to 240 of about 42,399 (264)

Query evaluation via tree-decompositions

Journal of the ACM, 2002
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or queries. We systematically study these methods.In the first part of the article, we consider arbitrary formulas on tree-like structures.
Jörg Flum, Markus Frick, Martin Grohe
openaire   +1 more source

Tree decompositions of small diameter

1998
Motivated by applications in parallel and dynamic graph algorithms, we investigate the tradeoff between width and diameter of tree decompositions. For all integers n, k and K with 1 ≤ k ≤ K ≤ n− 1, denote by D(n, k, K) the maximum, over all n-vertex graphs G of treewidth k, of the smallest diameter of a tree decomposition of G of width K.
Bodlaender, Hans L., Hagerup, Torben
openaire   +3 more sources

Some results on tree decomposition of graphs

Journal of Graph Theory, 1995
AbstractWe investigate tree decompositions (T,(Xt)tϵV(T)) whose width is “close to optimal” and such that all the subtrees of T induced by the vertices of the graph are “small.” We prove the existence of such decompositions for various interpretations of “close to optimal” and “small.” As a corollary of these results, we prove that the dilation of a ...
Guoli Ding, Bogdan Oporowski
openaire   +1 more source

On resolvable tree‐decompositions of complete graphs

Journal of Graph Theory, 1988
AbstractA partition of the edge set of a graph H into subsets inducing graphs H1,…,Hs isomorphic to a graph G is said to be a G‐decomposition of H. A G‐decomposition of H is resolvable if the set {H1,…,Hs} can be partitioned into subsets, called resolution classes, such that each vertex of H occurs precisely once in each resolution class. We prove that
openaire   +1 more source

Guiding SAT Diagnosis with Tree Decompositions

2004
A tree decomposition of a hypergraph is a construction that captures the graph’s topological structure. Every tree decomposition has an associated tree width, which can be viewed as a measure of how tree-like the original hypergraph is. Tree decomposition has proven to be a very useful theoretical vehicle for generating polynomial algorithms for ...
Per Bjesse, James H. Kukula, Robert F. Damiano, Ted Stanion, Yunshan Zhu   +4 more
openaire   +1 more source

TREE-DECOMPOSITIONS AND THE MODEL-CHECKING PROBLEM

2004
Summary: The purpose of this article is to survey some of the results on model-checking based on the notion of tree-decomposition.
openaire   +2 more sources

TREE DECOMPOSITIONS OF GRAPHS

2006
AbstractThis chapter provides an introduction to tree decomposition and treewidth, important concepts from modern graph theory. Treewidth is one of the best studied and most significant structural parameters. The construction of tree decompositions is briefly discussed, followed by special considerations applying to planar graphs. The main focus of the
openaire   +1 more source

Disentangling drivers of litter decomposition in a multi-continent network of tree diversity experiments

Science of the Total Environment, 2023
Sebastian Kepfer Rojas, Nadia Barsoum
exaly  

Tree species richness and fungi in freshly fallen leaf litter: Unique patterns of fungal species composition and their implications for enzymatic decomposition

Soil Biology and Biochemistry, 2018
Tesfaye Wubet, Keping Ma, François Buscot   +2 more
exaly  

Microbial groups and their functions control the decomposition of coniferous litter: A comparison with broadleaved tree litters

Soil Biology and Biochemistry, 2019
Zhitang Lyu, Jiaojun Zhu, Kai Yang
exaly