✦ LIBER ✦

A polynomial time algorithm for subpattern matching

✍ Scribed by Nyo, H.L.; Minsoo Suk

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for template pattern ma

✍ Yoshihiro Shima; Seiji Kashioka; Masakazu Ejiri 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 687 KB

Polynomial-Time Geometric Matching for O

✍ Todd A. Cass 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 653 KB

A polynomial time algorithm for GapCVPP

✍ ChengLiang Tian, LiDong Han, GuangWu Xu 📂 Article 📅 2013 🏛 Science in China Press (SCP) 🌐 English ⚖ 205 KB

A polynomial-time algorithm for a stable

✍ Rashid Farooq 📂 Article 📅 2008 🏛 Japan Society for Industrial and Applied Mathemati 🌐 English ⚖ 936 KB

A polynomial algorithm for b-matchings:

✍ Richard P. Anstee 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 373 KB

A new polynomial-time algorithm for line

✍ N. Karmarkar 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 822 KB