Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks

DOI10.1002/net.22123zbMath1529.90041OpenAlexW4293561674MaRDI QIDQ6179710

Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22123

zbMATH Keywords

network optimizationedge labelingtemporal graphtemporal pathtemporal reachabilityedge scheduled networktime assignment

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Label-connected graphs and the gossip problem
• Dynamic graph models
• Temporal network optimization subject to connectivity constraints
• Time-stamped graphs and their associated influence digraphs
• Nominal and robust train timetabling problems
• Assigning times to minimise reachability in temporal graphs
• On computing Pareto optimal paths in weighted time-dependent networks
• A Guide to Temporal Networks
• A survey of gossiping and broadcasting in communication networks
• Connection Scan Algorithm
• Temporal Network Optimization Subject to Connectivity Constraints
• The theory of dynamic programming
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*
• Connectivity and inference problems for temporal networks
• Encyclopedia of Algorithms
• Finding Temporal Paths Under Waiting Time Constraints.
• Temporal Reachability Minimization: Delaying vs. Deleting
• The Complexity of Transitively Orienting Temporal Graphs

This page was built for publication: Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks