Results 91 to 100 of about 1,027 (141)
Pathwidth is NP-Hard for Weighted Trees
, 2009 International audienceThe pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the pathwidth problem is NP-hard for particular subclasses of chordal graphs, and we deduce ...
Ioan Todinca +3 more
core +1 more source
Nondeterministic Graph Searching: From Pathwidth to Treewidth
, 2005 We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial analysis applying to both pathwidth and treewidth.
Fomin, Fedor +6 more
core +1 more source
Romeo and Juliet Meeting in Forest Like Regions
, 2023 Misra N, Mulpuri M, Tale P, Viramgami G.
europepmc +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
On Compiling Structured CNFs to OBDDs. [PDF]
Theory Comput Syst, 2017 Bova S, Slivovsky F.
europepmc +1 more source
Counting Linear Extensions: Parameterizations by Treewidth. [PDF]
Algorithmica, 2019 Eiben E, Ganian R, Kangas K, Ordyniak S.
europepmc +1 more source
Polynomial bounds for pathwidth
Dallard, Milanič, and Štorgel conjectured that for a hereditary graph class $\mathcal{G}$, if there is some function $f:\mathbb{N}\to\mathbb{N}$ such that every graph $G\in \mathcal{G}$ with clique number $ω(G)$ has treewidth at most $f(ω(G))$, then there is a polynomial function $f$ with the same property.
openaire +2 more sources
Maximum-scoring path sets on pangenome graphs of constant treewidth. [PDF]
Front BioinformBrejová B +3 more
europepmc +1 more source