Results 91 to 100 of about 2,587 (156)

The Treewidth and Pathwidth of Graph Unions

open access: yesSIAM Journal on Discrete Mathematics
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

Exclusive Graph Searching vs. Pathwidth

open access: yes, 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

open access: yes, 2023
Misra N, Mulpuri M, Tale P, Viramgami G.
europepmc   +1 more source

The Bounded Pathwidth of Control-Flow Graphs [PDF]

open access: diamond, 2023
Giovanna Kobus Conrado   +2 more
openalex   +1 more source

Home - About - Disclaimer - Privacy