Cited in
(23)- How fast can we reach a target vertex in stochastic temporal graphs?
- Computing parameters of sequence-based dynamic graphs
- Temporal vertex cover with a sliding time window
- Deleting edges to restrict the size of an epidemic in temporal networks
- Sliding window temporal graph coloring
- Temporal vertex cover with a sliding time window
- The complexity of finding small separators in temporal graphs
- Graph signatures: identification and optimization
- Temporal matching
- KronFit
- Algorithm 457
- RDyn
- EpiContactTrace
- MotifCut
- Efficient temporal core maintenance of massive graphs
- Computing maximal cliques in link streams
- A new temporal interpretation of cluster editing
- The temporal explorer who returns to the base
- An information-theoretic framework for the lossy compression of link streams
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- MultilayerGM
- The complexity of finding small separators in temporal graphs
- Temporal cliques admit sparse spanners
This page was built for software: cliques
