Temporally connected components
From MaRDI portal
Publication:6612544
DOI10.1016/j.tcs.2024.114757MaRDI QIDQ6612544
Eric Sanlaville, Jason Schoeters, Stefan Balev
Publication date: 1 October 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
algorithmconnected componentpolynomial-time reductiontemporal connectivity\(\mathrm{N}\)P-complete problemstemporal graph theory
Cites Work
- The complexity of determining the rainbow vertex-connection of a graph
- Label-connected graphs and the gossip problem
- Efficient continuous-time dynamic network flow algorithms
- A connectivity model for agreement in dynamic systems
- Computing parameters of sequence-based dynamic graphs
- The complexity of finding small separators in temporal graphs
- Temporal cliques admit sparse spanners
- Dynamic evolution of shipping network based on hypergraph
- The complexity of optimal design of temporally connected graphs
- Gossips and telephones
- Components in time-varying graphs
- Algorithms on evolving graphs
- Graph Theory
- A Graph Model for Fault-Tolerant Computing Systems
- On Verifying and Maintaining Connectivity of Interval Temporal Networks
- The State of the Art in Dynamic Graph Algorithms
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems
- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Computing maximum matchings in temporal graphs.
- On cliques in graphs
- A study of connectivity on dynamic graphs: computing persistent connected components
- Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
- On computing large temporal (unilateral) connected components
- Extended Abstracts EuroComb 2021
This page was built for publication: Temporally connected components
