Results 91 to 100 of about 2,587 (156)
The Treewidth and Pathwidth of Graph Unions
Given two $n$-vertex graphs $G_1$ and $G_2$ of bounded treewidth, is there an $n$-vertex graph $G$ of bounded treewidth having subgraphs isomorphic to $G_1$ and $G_2$? Our main result is a negative answer to this question, in a strong sense: we show that the answer is no even if $G_1$ is a binary tree and $G_2$ is a ternary tree.
Bogdan Alecu +5 more
openaire +3 more sources
Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics. [PDF]
Marchand B, Ponty Y, Bulteau L.
europepmc +1 more source
Exclusive Graph Searching vs. Pathwidth
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
Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number [PDF]
Tale, Prafullkumar
openalex +1 more source
A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth [PDF]
Mugurel Ionuţ Andreica +2 more
openalex +1 more source
Romeo and Juliet Meeting in Forest Like Regions
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]
Fernandes FAN +4 more
europepmc +1 more source
Some Reduction Procedure for Computing Pathwidth of Undirected Graphs
Masataka Ikeda, Hiroshi Nagamochi
openalex +2 more sources
The Bounded Pathwidth of Control-Flow Graphs [PDF]
Giovanna Kobus Conrado +2 more
openalex +1 more source

