✦ LIBER ✦

An algorithm for finding input–output constrained convex sets in an acyclic digraph

✍ Scribed by G. Gutin; A. Johnstone; J. Reddington; E. Scott; A. Yeo

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for resource allocation wit

✍ Jérôme Doutriaux 📂 Article 📅 1983 🏛 Springer Milan 🌐 English ⚖ 432 KB

Constrained optimization in L∞-norm: An

✍ Lakshman S. Thakur 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 800 KB

A parallel algorithm for finding a block

✍ Andrew V. Goldberg; Robert E. Tarjan 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 957 KB

An algorithm for finding a vector in the

✍ Sverre Storøy 📂 Article 📅 1973 🏛 Springer Netherlands 🌐 English ⚖ 220 KB

An improved algorithm for finding a leng

✍ Hsin-Hao Su; Chin Lung Lu; Chuan Yi Tang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 140 KB

An algorithm for finding a large indepen

✍ Norishige Chiba; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 333 KB 👁 1 views