The directed temporal graph settings form a single reachability hierarchy topped by strict and simple graphs, while undirected settings split into two incomparable strands.
Vulnerability of scheduled networks and a generalization of menger's theorem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DM 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs
The directed temporal graph settings form a single reachability hierarchy topped by strict and simple graphs, while undirected settings split into two incomparable strands.