Results 61 to 70 of about 98 (93)
Graph Homomorphism, Monotone Classes and Bounded Pathwidth
In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational complexity can be described for all such graph classes, giving a dichotomy between those classes for which the ...
Tala Eagling-Vose +3 more
openaire +2 more sources
Exclusive Graph Searching vs. Pathwidth
, 2014 Dans les jeux de capture (Graph Searching), une équipe d'agents doit capturer un fugitif invisible se déplaçant rapidement dans un graphe. De façon équivalente, les agents doivent nettoyer un réseau contaminé. Le problème est de calculer le nombre minimum d'agents nécessaires pour accomplir cette tache.
Markou, Euripides +2 more
openaire +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
Maximum-scoring path sets on pangenome graphs of constant treewidth. [PDF]
Front BioinformBrejová B +3 more
europepmc +1 more source