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.
Akrida, Leszek Gasieniec, George B
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2025 1verdicts
CONDITIONAL 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.