Results 141 to 150 of about 278 (179)
Design and Analysis of Minimum-Weighted Connected Capacitated Vertex Cover Algorithms for Link Monitoring in IoT-Enabled WSNs. [PDF]
Sensors (Basel)Kol M +3 more
europepmc +1 more source
Bayesian networks for predicting clinical outcomes in COVID-19 patients: A retrospective study in a resource-limited setting. [PDF]
PLoS OneFilamant TC +2 more
europepmc +1 more source
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans L Bodlaender, Arie M C A Koster
exaly +6 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Algorithms, 1997
Summary: We consider a special variant of tree-decompositions, called domino tree-decompositions, and the related notion of domino treewidth. In a domino tree- decomposition, each vertex of the graph belongs to at most two nodes of the tree. We prove that for every \(k\), \(d\), there exists a constant \(c_{k,d}\) such that a graph with treewidth at ...
Bodlaender, Hans, Engelfriet, Joost
openaire +2 more sources
Summary: We consider a special variant of tree-decompositions, called domino tree-decompositions, and the related notion of domino treewidth. In a domino tree- decomposition, each vertex of the graph belongs to at most two nodes of the tree. We prove that for every \(k\), \(d\), there exists a constant \(c_{k,d}\) such that a graph with treewidth at ...
Bodlaender, Hans, Engelfriet, Joost
openaire +2 more sources
Journal of Combinatorial Theory Series B, 2018 The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to determining the minimum vertex congestion of an embedding of $G$ into a tree.
David R Wood
exaly +3 more sources