A new temporal graph model from word-representable graphs is introduced with claimed 2δn and 2dn exploration bounds, but a key lemma (Lemma 7) is false, invalidating the general upper bound.
Optimizing reachability sets in temporal graphs by delaying
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.DS 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Exploring Word-Representable Temporal Graphs
A new temporal graph model from word-representable graphs is introduced with claimed 2δn and 2dn exploration bounds, but a key lemma (Lemma 7) is false, invalidating the general upper bound.