Results 81 to 90 of about 609 (128)
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
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
Clifford Algebras Meet Tree Decompositions. [PDF]
Algorithmica, 2019 Włodarczyk M.
europepmc +1 more source
Intrinsic linking of chromatin fiber in human cells
, 2022 Borodzik M +8 more
europepmc +1 more source
2-Connecting outerplanar graphs without blowing up the pathwidth
, 2014 Jasine Babu +3 more
openalex +1 more source
On Compiling Structured CNFs to OBDDs. [PDF]
Theory Comput Syst, 2017 Bova S, Slivovsky F.
europepmc +1 more source