Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes

DOI10.1007/978-3-031-08740-0_16OpenAlexW4285131899MaRDI QIDQ2104268

Kitty Meeks

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08740-0_16

zbMATH Keywords

computational complexityreachabilityparameterized algorithmstemporal graphsspreading processes

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Deleting edges to restrict the size of an epidemic: a new application for treewidth
• Temporal network optimization subject to connectivity constraints
• Finding temporal paths under waiting time constraints
• Assigning times to minimise reachability in temporal graphs
• Deleting edges to restrict the size of an epidemic in temporal networks
• Connectivity and inference problems for temporal networks
• Edge exploration of temporal graphs
• Temporal Reachability Minimization: Delaying vs. Deleting