Results 151 to 160 of about 13,814 (224)
Treewidth computation and extremal combinatorics
Fedor V. Fomin, Yngve Villanger
openalex +2 more sources
A tourist guide through treewidth
Summary: A short overview is given of many recent results in algorithmic graph theory that deal with the notions treewidth and pathwidth. We discuss algorithms that find tree-decompositions, algorithms that use tree- decompositions to solve hard problems efficiently, graph minor theory, and some applications.
openaire +4 more sources
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm
Frederic Dorn, Jan Arne Telle
openalex +1 more source
An ontology-based knowledge graph for representing interactions involving RNA molecules. [PDF]
Cavalleri E+11 more
europepmc +1 more source
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
MohammadHossein Bateni+2 more
openalex +2 more sources
A bound on the treewidth of planar even-hole-free graphs
Ana Silva+2 more
openalex +1 more source
On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth [PDF]
Igor Razgon
openalex +1 more source
Intrinsic linking of chromatin fiber in human cells
Borodzik M+8 more
europepmc +1 more source