The following pages link to (Q5092419):
Displaying 10 items.
- Edge removal in random contact networks and the basic reproduction number (Q353087) (← links)
- Optimal link removal for epidemic mitigation: A two-way partitioning approach (Q423087) (← links)
- An edge deletion model for complex networks (Q719248) (← links)
- Preferential deletion in dynamic models of web-like networks (Q845994) (← links)
- Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes (Q2104268) (← links)
- How fast can we reach a target vertex in stochastic temporal graphs? (Q2194859) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- Simple, strict, proper, happy: a study of reachability in temporal graphs (Q6122608) (← links)
- Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs (Q6155232) (← links)
- Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks (Q6179710) (← links)