✦ LIBER ✦

Algorithms for finding an induced cycle in planar graphs

✍ Scribed by Ken-ichi Kawarabayashi; Yusuke Kobayashi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear algorithm for finding Hamiltoni

✍ Takao Asano; Shunji Kikuchi; Nobuji Saito 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 901 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

An optimal algorithm for finding dominat

✍ J.Mark Keil; Doug Schaefer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 972 KB

Exact algorithms for the Hamiltonian cyc

✍ Vladimir G. Deı˘neko; Bettina Klinz; Gerhard J. Woeginger 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 167 KB

Finding short cycles in planar graphs us

✍ Dana Richards 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 635 KB

Finding small simple cycle separators fo

✍ Gary L. Miller 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 1007 KB