Automated bounds on recursive structures

MaRDI QIDQ3513961zbMATH OpenFDO

Authors Wayne Goddard

Publication date 21 July 2008

zbMATH Keywords

combining structuresparametertable

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• A note on trees, tables, and algorithms
• scientific article; zbMATH DE number 46126
• Practical algorithms on partial k-trees with an application to domination-like problems
• Table design in dynamic programming
• A Dynamic Programming Approach to the Dominating Set Problem on k-Trees

Cited in

(4)

• On total domination in the Cartesian product of graphs
• Automated recurrence analysis for almost-linear expected-runtime bounds
• Automatic structures of bounded degree revisited
• On 2-limited packings of complete grid graphs

This page was built for publication: Automated bounds on recursive structures

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