The complexity of computing optimum labelings for temporal connectivity
From MaRDI portal
Publication:6615311
DOI10.1016/j.jcss.2024.103564MaRDI QIDQ6615311
Paul G. Spirakis, George B. Mertzios, Nina Klobas, Hendrik Molter
Publication date: 8 October 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Traveling salesman problems in temporal graphs
- Label-connected graphs and the gossip problem
- Computing maximal cliques in link streams
- On the parameterized complexity of multiple-interval graph problems
- Temporal network optimization subject to connectivity constraints
- Temporal vertex cover with a sliding time window
- Sliding window temporal graph coloring
- Temporal cliques admit sparse spanners
- How fast can we reach a target vertex in stochastic temporal graphs?
- Assigning times to minimise reachability in temporal graphs
- Coloring temporal graphs
- The complexity of optimal design of temporally connected graphs
- On temporal graph exploration
- Deleting edges to restrict the size of an epidemic in temporal networks
- Optimizing reachability sets in temporal graphs by delaying
- A survey of gossiping and broadcasting in communication networks
- A Problem with Telephones
- On the Size and the Approximability of Minimum Temporally Connected Subgraphs
- Reducibility among Combinatorial Problems
- Temporal Network Theory
- The steiner problem in graphs
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Connectivity and inference problems for temporal networks
- Feedback edge sets in temporal graphs
- Temporal Reachability Minimization: Delaying vs. Deleting
- Computing maximum matchings in temporal graphs
- The Complexity of Transitively Orienting Temporal Graphs
- The complexity of computing optimum labelings for temporal connectivity
This page was built for publication: The complexity of computing optimum labelings for temporal connectivity
