Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes
From MaRDI portal
Publication:2104268
Recommendations
- Random graph models for temporal processes in social networks*
- Assigning times to minimise reachability in temporal graphs
- Reachability in graph timelines
- Deleting edges to restrict the size of an epidemic in temporal networks
- Deleting edges to restrict the size of an epidemic in temporal networks
- Quantifying transient spreading dynamics on networks
- Optimizing reachability sets in temporal graphs by delaying
Cites work
- Assigning times to minimise reachability in temporal graphs
- Connectivity and inference problems for temporal networks
- 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
- Edge exploration of temporal graphs
- Finding temporal paths under waiting time constraints
- Temporal network optimization subject to connectivity constraints
- Temporal Reachability Minimization: Delaying vs. Deleting
Cited in
(6)- Deleting edges to restrict the size of an epidemic in temporal networks
- Exploring concurrency and reachability in the presence of high temporal resolution
- Temporal reachability minimization: delaying vs. deleting
- Harmonious colourings of temporal matchings
- Temporal graph realization with bounded stretch
- Temporal graph realization with bounded stretch
This page was built for publication: Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104268)
