Results 101 to 110 of about 3,161 (171)
On the Pathwidth of Planar Graphs
, 2006 Fomin and Thilikos in [5] conjectured that there is a constant $c$ such that, for every $2$-connected planar graph $G$, {pw}(G^*) \leq 2\text{pw}(G)+c$ (the same question was asked simutaneously by Coudert, Huc and Sereni in [4]). By the results of Boedlander and Fomin [2] this holds for every outerplanar graph and actually is tight by Coudert, Huc and
Amini, Omid +2 more
openaire +1 more source
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Algorithmica, 2023 Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source
Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics. [PDF]
Algorithms Mol Biol, 2022 Marchand B, Ponty Y, Bulteau L.
europepmc +1 more source
Helicopter search problems, bandwidth and pathwidth
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Digraph searching, directed vertex separation and directed pathwidth
, 2007 Boting Yang, Yi Cao
openalex +1 more source
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm
, 2008 Frederic Dorn, Jan Arne Telle
openalex +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