Results 171 to 180 of about 4,791 (239)
Bridging Treewidth and Clique-Width via Cograph-Modular-Treewidth
Many classical graph problems - such as Max Cut, Chromatic Number, Edge Dominating Set, and Hamiltonian Cycle - are polynomial-time solvable on cographs, fixed-parameter tractable (FPT) when parameterized by treewidth, but W[1]-hard when parameterized by clique-width.
Blažej, Václav +3 more
openaire +1 more source
Critical assessment of synthetic accessibility scores in computer-assisted synthesis planning. [PDF]
J Cheminform, 2023 Skoraczyński G +3 more
europepmc +1 more source
On the Number of Labeled Graphs of Bounded Treewidth
, 2017 Julien Baste, Marc Noy, Ignasi Sau
openalex +2 more sources
Defensive alliances in graphs of bounded treewidth [PDF]
, 2018 Bernhard Bliem, Stefan Woltran
openalex +1 more source
An ontology-based knowledge graph for representing interactions involving RNA molecules. [PDF]
Sci DataCavalleri E +11 more
europepmc +1 more source
Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs [PDF]
Sally Dong, Guanghao Ye
openalex +1 more source
Intrinsic linking of chromatin fiber in human cells
, 2022 Borodzik M +8 more
europepmc +1 more source
Time and Space Results for Parity Games with Bounded Treewidth
, 2013 John Fearnley, Sven Schewe
openalex +1 more source
Approximating Sparsest Cut in Graphs of Bounded Treewidth [PDF]
, 2010 Eden Chlamtáč +2 more
openalex +1 more source