Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes
type: Item
instance of: scholarly article
title: Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes
DOI: 10.1007/978-3-031-08740-0_16
author: Kitty Meeks
publication date: 2022-12-07T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7627928
zbMATH Keywords: reachability
zbMATH Keywords: temporal graphs
zbMATH Keywords: spreading processes
zbMATH Keywords: computational complexity
zbMATH Keywords: parameterized algorithms
MaRDI profile type: Publication
full work available at URL: 978-3-031-08740-0 16
OpenAlex ID: W4285131899
cites work: Edge exploration of temporal graphs
cites work: Finding temporal paths under waiting time constraints
cites work: Deleting edges to restrict the size of an epidemic in temporal networks
cites work: Deleting edges to restrict the size of an epidemic: a new application for treewidth
cites work: Assigning times to minimise reachability in temporal graphs
cites work: Connectivity and inference problems for temporal networks
cites work: Temporal network optimization subject to connectivity constraints
cites work: Temporal Reachability Minimization: Delaying vs. Deleting
Recommended article: Random graph models for temporal processes in social networks*
Recommended article: Assigning times to minimise reachability in temporal graphs
Recommended article: Reachability in graph timelines
Recommended article: Deleting edges to restrict the size of an epidemic in temporal networks
Recommended article: Q5092419
Recommended article: Quantifying transient spreading dynamics on networks
Recommended article: Optimizing reachability sets in temporal graphs by delaying
description: scientific article; zbMATH DE number 7627928