Results 141 to 150 of about 306 (178)

Design and Analysis of Minimum-Weighted Connected Capacitated Vertex Cover Algorithms for Link Monitoring in IoT-Enabled WSNs. [PDF]

Sensors (Basel)
Kol M, Uslu EE, Dagdeviren ZA, Dagdeviren O.   +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 One
Filamant TC, Raherinirina AF, Totohasina A.   +2 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Domino Treewidth

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

The treewidth of line graphs

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 Wood
exaly   +3 more sources

Contraction obstructions for treewidth

Journal of Combinatorial Theory Series B, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petr Golovach, Fedor V Fomin, Dimitrios M Thilikos   +2 more
exaly   +4 more sources

A Note on Multiflows and Treewidth

Algorithmica, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd   +2 more
openaire   +1 more source