Temporal cliques that are k-hop dismountable for any k are also dismountable in at most three hops, which simplifies the proof that every temporal clique has an O(n log n) spanner.
On the size and the approximability of minimum temporally connected subgraphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.DM 1years
2025 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Dismountability in Temporal Cliques Revisited
Temporal cliques that are k-hop dismountable for any k are also dismountable in at most three hops, which simplifies the proof that every temporal clique has an O(n log n) spanner.