Results 11 to 20 of about 42,399 (263)
Characterizing DAG-depth of Directed Graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We study DAG-depth, a structural depth measure of directed graphs, which naturally extends the tree-depth of ordinary graphs. We define a DAG-depth decomposition as a strategy for the cop player in the lift-free version of the cops-and-robber game on ...
Matúš Bezek
doaj +1 more source
Botanical Sciences, 2022 Background: There is limited information to predict the direction in which canopy modification affects the microbial carbon use efficiency (CUE) and, consequently, the magnitude and stability of litter decomposition in monodominant sacred fir (Abies ...
Eduardo M. Choreño-Parra +6 more
doaj +1 more source
Frontiers in Plant Science, 2023 BackgroundTree mycorrhizal types (arbuscular mycorrhizal fungi and ectomycorrhizal fungi) alter nutrient use traits and leaf physicochemical properties and, thus, affect leaf litter decomposition.
Benjawan Tanunchai +16 more
doaj +1 more source
Minimum size tree-decompositions [PDF]
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bi Li 0004 +3 more
openaire +3 more sources
Tree Decompositions with Small Cost [PDF]
Discrete Applied Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans L. Bodlaender, Fedor V. Fomin
openaire +5 more sources
Correspondence between Multilevel Graph Partitions and Tree Decompositions
Algorithms, 2019 We present a mapping between rooted tree decompositions and node separator based multilevel graph partitions. Significant research into both tree decompositions and graph partitions exists.
Michael Hamann, Ben Strasser
doaj +1 more source
Discrete Mathematics, 2018 Let $T$ be a tree, we show that the null space of the adjacency matrix of $T$ has relevant information about the structure of $T$. We introduce the Null Decomposition of trees, and use it in order to get formulas for independence number and matching number of a tree.
Daniel A. Jaume, Gonzalo Molina
openaire +2 more sources
A Machine Learning Approach to Algorithm Selection for Exact Computation of Treewidth
Algorithms, 2019 We present an algorithm selection framework based on machine learning for the exact computation of treewidth, an intensively studied graph parameter that is NP-hard to compute.
Borislav Slavchev +2 more
doaj +1 more source
Orthogonal Tree Decompositions of Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2018 This paper studies graphs that have two tree decompositions with the property that every bag from the first decomposition has a bounded-size intersection with every bag from the second decomposition. We show that every graph in each of the following classes has a tree decomposition and a linear-sized path decomposition with bounded intersections: (1 ...
Vida Dujmovic +4 more
openaire +4 more sources
Вопросы лесной науки, 2022 The paper provides an overview of Russian and foreign articles devoted to the study of the tree litter production and decomposition in forest ecosystems subjected to natural and anthropogenic factors.
E. A. Ivanova
doaj +1 more source