Simple, strict, proper, happy: a study of reachability in temporal graphs
From MaRDI portal
Publication:6122608
DOI10.1016/j.tcs.2024.114434OpenAlexW4391578353WikidataQ128542593 ScholiaQ128542593MaRDI QIDQ6122608
Arnaud Casteigts, Timothée Corsini, Writika Sarkar
Publication date: 1 March 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114434
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parsimonious flooding in dynamic graphs
- A constructive proof of Vizing's theorem
- A connectivity model for agreement in dynamic systems
- Finding temporal paths under waiting time constraints
- Computing parameters of sequence-based dynamic graphs
- Temporal cliques admit sparse spanners
- Distributed exploration of dynamic rings
- The complexity of optimal design of temporally connected graphs
- Temporal flows in temporal networks
- On computing Pareto optimal paths in weighted time-dependent networks
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
- Minimum weight paths in time-dependent networks
- On the Size and the Approximability of Minimum Temporally Connected Subgraphs
- The Complexity of Data Aggregation in Static and Dynamic Wireless Sensor Networks
- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
- Some Combinatorial Theorems on Monotonicity
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Connectivity and inference problems for temporal networks
- Temporal graph classes: a view through temporal separators
This page was built for publication: Simple, strict, proper, happy: a study of reachability in temporal graphs
