Directed request graphs need n - cc + dfvs temporal arcs; undirected strongly connected requests allow n-1 edges iff every collection of pairwise non-vertex-disjoint closed walks shares a vertex, testable in polynomial time.
Foremost, fastest, shortest: Temporal graph realization under various path metrics
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Designing sparse temporal graphs satisfying connectivity requirements
Directed request graphs need n - cc + dfvs temporal arcs; undirected strongly connected requests allow n-1 edges iff every collection of pairwise non-vertex-disjoint closed walks shares a vertex, testable in polynomial time.