✦ LIBER ✦

Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time

✍ Scribed by Saxe, James B.

Book ID: 118212371
Publisher: Society for Industrial and Applied Mathematics
Year: 1980
Weight: 970 KB
Volume: 1
Category: Article
ISSN: 0196-5212
DOI: 10.1137/0601042

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial time algorithm for constructi

Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs

✍ Satoshi Fujita 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 415 KB

A Polynomial-Time Algorithm for Finding

A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs

✍ Zhivko P. Nedev; Peter T. Wood 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 266 KB

A new polynomial-time algorithm for the

A new polynomial-time algorithm for the maximum weighted (χ(G) — 1)-coloring problem in comparability graphs

✍ A. Hertz 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 363 KB

A dynamic programming algorithm for sche

A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems

✍ J. Miltenburg; G. Steiner; S. Yeomans 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 812 KB

## A dynamic programming procedure for determining the optimal just-in-time (JIT) production schedule for a mixed-model facility is presented. Compared to previously available optimization methods it substantially reduces computation and storage requirements, enabling practical-sized problems to b

Memory and time improvements in a dynami

Memory and time improvements in a dynamic programming algorithm for matching speech patterns

✍ Tappert, C.; Das, S. 📂 Article 📅 1978 🏛 IEEE ⚖ 478 KB