
On Finding Separators in Temporal Split and Permutation Graphs
Removing all connections between two vertices s and z in a graph by remo...
read it

Reducing graph transversals via edge contractions
For a graph parameter π, the Contraction(π) problem consists in, given a...
read it

Edge exploration of temporal graphs
We introduce a natural temporal analogue of Eulerian circuits and prove ...
read it

Dispersing obnoxious facilities on a graph
We study a continuous facility location problem on a graph where all edg...
read it

Deleting edges to restrict the size of an epidemic in temporal networks
A variety of potentially diseasespreading contact networks can be natur...
read it

How fast can we reach a target vertex in stochastic temporal graphs?
Temporal graphs are used to abstractly model reallife networks that are...
read it

Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters
We continue and extend previous work on the parameterized complexity ana...
read it
Feedback Edge Sets in Temporal Graphs
The classical, lineartime solvable Feedback Edge Set problem is concerned with finding a minimum number of edges intersecting all cycles in a (static, unweighted) graph. We provide a first study of this problem in the setting of temporal graphs, where edges are present only at certain points in time. We find that there are four natural generalizations of Feedback Edge Set, all of which turn out to be NPhard. We also study the tractability of these problems with respect to several parameters (solution size, lifetime, and number of graph vertices, among others) and obtain some parameterized hardness but also fixedparameter tractability results.
READ FULL TEXT
Comments
There are no comments yet.