scientific article; zbMATH DE number 1135820
From MaRDI portal
Publication:4381299
zbMATH Open0893.68113MaRDI QIDQ4381299
Publication date: 5 May 1998
Title of this publication is not available (Why is that?)
Related Items (5)
Revisiting dynamic programming for finding optimal subtrees in trees โฎ Title not available (Why is that?) โฎ Uniform tree approximation by global optimization techniques โฎ Finding optimal satisficing strategies for and-or trees โฎ A Comparison of Many Max-tree Computation Algorithms
Recommendations
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- On finding optimal polytrees ๐ ๐
- Trees for algorithmics ๐ ๐
- Revisiting dynamic programming for finding optimal subtrees in trees ๐ ๐
- Efficient algorithms for generalized cutโtrees ๐ ๐
- Optimal Search in Trees ๐ ๐
- Constructing optimal search trees in optimal time ๐ ๐
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4381299)