Results 141 to 150 of about 5,081 (203)
Reoptimization of parameterized problems. [PDF]
Acta Inform, 2022 Böckenhauer HJ +3 more
europepmc +1 more source
Quantum-augmented graph differential geometry enhances accuracy in protein-protein interaction prediction. [PDF]
Sci RepKarthick V +4 more
europepmc +1 more source
The Firefighter problem with dynamic defence costs. [PDF]
PLoS OneHunter E, Enright J.
europepmc +1 more source
Infrared: a declarative tree decomposition-powered framework for bioinformatics. [PDF]
Algorithms Mol BiolYao HT +4 more
europepmc +1 more source
A tourist guide through treewidth
Acta Cybern., 1992 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 +5 more sources
Dominating sets and local treewidth
It is known that the treewidth of a planar graph with a dominating set of size d is O(sqrt{d}) and this fact is used as the basis for several fixed parameter algorithms on planar graphs. An interesting question motivating our study is if similar bounds
Fomin, Fedor V. +1 more
core
An ontology-based knowledge graph for representing interactions involving RNA molecules. [PDF]
Sci DataCavalleri E +11 more
europepmc +1 more source
Intrinsic linking of chromatin fiber in human cells
, 2022 Borodzik M +8 more
europepmc +1 more source