Results 91 to 100 of about 2,730 (147)
Protocol for aerosolization challenge of mice with Bordetella pertussis. [PDF]
STAR Protoc, 2023 Bitzer G +3 more
europepmc +1 more source
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings [PDF]
, 2013 Thérèse Biedl +5 more
openalex +1 more source
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 +2 more sources
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
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
Graphs of unbounded linear cliquewidth must transduce all trees [PDF]
arXivThe Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs: if a class of graphs has unbounded linear cliquewidth, then it can produce all trees via some fixed CMSO transduction.
arxiv