✦ LIBER ✦

Graph theoretic algorithms for the PLA folding problem

✍ Scribed by Lecky, J.E.; Murphy, O.J.; Absher, R.G.

Book ID: 119777906
Publisher: IEEE
Year: 1989
Tongue: English
Weight: 862 KB
Volume: 8
Category: Article
ISSN: 0278-0070
DOI: 10.1109/43.35554

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the orderability problem for PLA fold

On the orderability problem for PLA folding

✍ S.S. Ravi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Algorithms for some graph theoretical op

Algorithms for some graph theoretical optimization problems

✍ Linda S. Moonen 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 50 KB

An efficient algorithm for optimal PLA f

An efficient algorithm for optimal PLA folding

✍ Yeong-Yil Yang; Chong-Min Kyung 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 779 KB

An efficient algorithm for bipartite PLA

An efficient algorithm for bipartite PLA folding

✍ Chun-Yeh Liu; Saluja, K.K. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 906 KB

Space efficient algorithms for some grap

Space efficient algorithms for some graph theoretical problems

✍ Joseph Ja'Ja'; Janos Simon 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 621 KB

A graph theoretic formulation of bit pat

A graph theoretic formulation of bit pattern algorithms for graphics

✍ Satoru Kawai 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 968 KB

A graph theoretic fm'mulal;ion of bil; patl:ern ttlgm'it,hms fro' computer graphics in presented. A two-dimensiomd N X N bit array, called dm canwts memm'y, in used I;. formubt~e the concept, s of dom~dn, bmmdary (;urve, and semming, which are used to describe basic picture processing ~figm'ithms su