The paper proves wait actions are redundant in Action Dependency Graphs and presents a quasi-linear-time construction algorithm (SCP) that produces sparser graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
extension 1
citation-polarity summary
fields
cs.MA 1years
2024 1verdicts
CONDITIONAL 1roles
extension 1polarities
extend 1representative citing papers
citing papers explorer
-
Streamlining the Action Dependency Graph Framework: Two Key Enhancements
The paper proves wait actions are redundant in Action Dependency Graphs and presents a quasi-linear-time construction algorithm (SCP) that produces sparser graphs.