On non-serial dynamic programming
From MaRDI portal
Publication:2561771
DOI10.1016/0097-3165(73)90016-2zbMATH Open0264.49021OpenAlexW2055916047MaRDI QIDQ2561771FDOQ2561771
Authors: U. Bertele, Francesco Brioschi 
Publication date: 1973
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(73)90016-2
Cites Work
- Title not available (Why is that?)
- Contribution to nonserial dynamic programming
- A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming
- Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems
- A theorem in nonserial dynamic programming
- Title not available (Why is that?)
- A note on a paper by Spillers and Hickerson
Cited In (14)
- Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing
- MiniBrass: soft constraints for MiniZinc
- Monoidal Width: Capturing Rank Width
- Width, depth, and space: tradeoffs between branching and dynamic programming
- Monoidal Width
- Algebras for tree decomposable graphs
- Twin-treewidth: a single-exponential logic-based approach
- An asymptotic analysis of labeled and unlabeled \(k\)-trees
- Edge-treewidth: algorithmic and combinatorial properties
- An improvement of Reed's treewidth approximation
- An improvement of Reed's treewidth approximation
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- Graph limits of random graphs from a subset of connected \(k\)-trees
- A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems
This page was built for publication: On non-serial dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2561771)
