Parameterized Spanning Tree Congestion
In this paper we study the Spanning Tree Congestion problem, where we are given a graph
$ G=(V, E) $ and are asked to find a spanning tree $ T $ of minimum maximum congestion …
$ G=(V, E) $ and are asked to find a spanning tree $ T $ of minimum maximum congestion …
On the Complexity of Target Set Selection in Simple Geometric Networks
M Dvořák, D Knop… - Discrete Mathematics & …, 2024 - dmtcs.episciences.org
In this work, we study the following deterministic model of disease spread. We are given a
social network represented as a simple, undirected graph G=(V, E), a threshold function t …
social network represented as a simple, undirected graph G=(V, E), a threshold function t …