✦ LIBER ✦

A polynomial time algorithm for finding the prime factors of cartesian-product graphs

✍ Scribed by Joan Feigenbaum; John Hershberger; Alejandro A. Schäffer

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Polynomial-Time Algorithm for Finding

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

A polynomial time algorithm for finding

✍ Edward Minieka 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB

A polynomial algorithm for constructing

✍ Bruce Hedman 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 250 KB

A linear time algorithm for finding all

✍ Ting-Yem Ho; Yue-Li Wang; Ming-Tsan Juan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 488 KB

An algorithm for finding the minimum ske

✍ G.B. Roshchin 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 325 KB

A Polynomial Time Algorithm for Finding

✍ Anders Yeo 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 181 KB