Always-connected k-edge-deficient temporal graphs admit exploration schedules of length O(nk log k) computable in polynomial time.
1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) , pages=
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
-
Exploration of $k$-edge-deficient temporal graphs in linear time
Always-connected k-edge-deficient temporal graphs admit exploration schedules of length O(nk log k) computable in polynomial time.