✦ LIBER ✦

Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

✍ Scribed by Jens Gramm; Jiong Guo; Falk Hüffner; Rolf Niedermeier

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generation of polynomial-time algorithms

✍ R. B. Borie 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 837 KB

A search algorithm for solving the gener

✍ E.I. Volynskii; M.Z. Khenkin 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 682 KB

Theoretical Convergence Analysis of a Ge

✍ X. Yang; M. Sun 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 218 KB

Polynomial-time algorithms for solving a

✍ Siqian Shen; J. Cole Smith 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB 👁 1 views

Limit laws for terminal nodes in random

✍ Hosam Mahmoud; Tatsuie Tsukiji 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 147 KB

Inverse eigenvalue problems and lists of

✍ Charles R. Johnson; António Leal Duarte; Carlos M. Saiago 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 201 KB