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
Infrared: a declarative tree decomposition-powered framework for bioinformatics. [PDF]
Yao HT +4 more
europepmc +1 more source
Weighted proper orientations of trees and graphs of bounded treewidth [PDF]
Júlio Aráujo +3 more
openalex
Critical assessment of synthetic accessibility scores in computer-assisted synthesis planning. [PDF]
Skoraczyński G +3 more
europepmc +1 more source
An ontology-based knowledge graph for representing interactions involving RNA molecules. [PDF]
Cavalleri E +11 more
europepmc +1 more source
Intrinsic linking of chromatin fiber in human cells
Borodzik M +8 more
europepmc +1 more source
A polynomial time algorithm for computation of the Tutte polynomials of graphs of bounded treewidth
Artur Andrzejak
openalex +2 more sources
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth
Bart M. P. Jansen +5 more
openalex +2 more sources
GPCRs Are Optimal Regulators of Complex Biological Systems and Orchestrate the Interface between Health and Disease. [PDF]
Leysen H +6 more
europepmc +1 more source
Graph Treewidth and Geometric Thickness Parameters [PDF]
Vida Dujmović, David R. Wood
openalex +1 more source

