The paper defines Stretched Temporal Graph Realization (STGR), proves it is NP-hard to approximate within sublinear factors in the period, and provides approximation, fixed-parameter, and local-search algorithms.
On the realization of a (p, s) -digraph with prescribed degrees
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Temporal Graph Realization With Bounded Stretch
The paper defines Stretched Temporal Graph Realization (STGR), proves it is NP-hard to approximate within sublinear factors in the period, and provides approximation, fixed-parameter, and local-search algorithms.