Results 101 to 110 of about 2,549 (154)
$b$-Coloring Parameterized by Pathwidth is XNLP-complete [PDF]
, 2022 Lars Jaffke +2 more
openalex +1 more source
A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem
, 2021 A. G. Klyuchikov, M. Vyalyi
openalex +2 more sources
Tree-decompositions of small pathwidth
Electronic Notes in Discrete Mathematics, 2001 The treewidth \(\text{ tw}(G)\) of \(G\) can be defined as minimum width of a tree-decomposition of \(G\), or minimum \(\omega(H)-1\) of a chordal triangulation \(H\) of \(G\). Similarely, the pathwidth \(\text{ pw}(G)\) can be defined via path-decompositions or triangulations into interval graphs. Thereby a path-decomposition is a tree-decomposition \(
openaire +2 more sources
Romeo and Juliet Meeting in Forest Like Regions
, 2023 Misra N, Mulpuri M, Tale P, Viramgami G.
europepmc +1 more source
TREEWIDTH and PATHWIDTH parameterized by vertex cover [PDF]
, 2013 Mathieu Chapelle +3 more
openalex +1 more source
Ultrasound-assisted extraction of anthocyanins and phenolics from jabuticaba (Myrciaria cauliflora) peel: kinetics and mathematical modeling. [PDF]
J Food Sci Technol, 2020 Fernandes FAN +4 more
europepmc +1 more source
Intrinsic linking of chromatin fiber in human cells
, 2022 Borodzik M +8 more
europepmc +1 more source
Clifford Algebras Meet Tree Decompositions. [PDF]
Algorithmica, 2019 Włodarczyk M.
europepmc +1 more source
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings
, 2012 Michał Pilipczuk
openalex +2 more sources
On Compiling Structured CNFs to OBDDs. [PDF]
Theory Comput Syst, 2017 Bova S, Slivovsky F.
europepmc +1 more source