Dynamic Programming as Graph Searching: An Algebraic Approach

DOI10.1145/322276.322285MaRDI QIDQ3926375zbMATH OpenOpenAlexFDO

Authors S. Gnesi, Ugo Montanari, Alberto Martelli

Publication date 1981

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322276.322285

zbMATH Keywords

algebraic approachalgebraic semanticsAND/OR graphcontinuous algebrasfunctional equationsgraph searchminimal cost pathsemantics of programming languagessymbolic system

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Programming involving graphs or networks (90C35) Dynamic programming (90C39) Programming in abstract spaces (90C48)

Cited in

(14)

• Systolic processing for dynamic programming problems
• The weighted list update problem and the lazy adversary
• Partially dynamic maintenance of minimum weight hyperpaths
• Directed hypergraphs and applications
• Dynamic maintenance of the transitive closure in disjunctive graphs
• A general heuristic bottom-up procedure for searching AND/OR graphs
• A Comprehensive Model of Dynamic Programming
• Contributions to a computational theory of policy advice and avoidability
• The why, how, and when of representations for complex systems
• Extensional equality preservation and verified generic programming
• Parallel best-first branch-and-bound in discrete optimization: a framework
• Domain-independent dynamic programming
• Dynamic maintenance of directed hypergraphs
• Computing the throughput of concatenation state machines

This page was built for publication: Dynamic Programming as Graph Searching: An Algebraic Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3926375)