Temporal reachability minimization: delaying vs. deleting

Cites Work

Maximal Flow Through a Network
A note on two problems in connexion with graphs
Fundamentals of parameterized complexity
Title not available (Why is that?)
Relationships between nondeterministic and deterministic tape complexities
Undirected connectivity in log-space
Title not available (Why is that?)
COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
Connectivity and inference problems for temporal networks
Editing graphs to satisfy degree constraints: a parameterized approach
Deleting edges to restrict the size of an epidemic in temporal networks
Deleting edges to restrict the size of an epidemic: a new application for treewidth
Assigning times to minimise reachability in temporal graphs
Optimizing reachability sets in temporal graphs by delaying
Temporal network optimization subject to connectivity constraints
On exploring always-connected temporal graphs of small pathwidth
Finding temporal paths under waiting time constraints
The complexity of finding small separators in temporal graphs
Temporal cliques admit sparse spanners
How fast can we reach a target vertex in stochastic temporal graphs?
On the size and the approximability of minimum temporally connected subgraphs
Faster exploration of degree-bounded temporal graphs
The temporal explorer who returns to the base
The complexity of finding temporal separators under waiting time constraints
On finding separators in temporal split and permutation graphs
Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes
Temporal Reachability Minimization: Delaying vs. Deleting
Non-strict Temporal Exploration
Two moves per time step make a difference
Title not available (Why is that?)
Feedback edge sets in temporal graphs
The complexity of computing optimum labelings for temporal connectivity

This page was built for publication: Temporal reachability minimization: delaying vs. deleting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564622)