✦ LIBER ✦

A note on finding compact sets in graphs represented by an adjacency list

✍ Scribed by Sung Kwon Kim

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on finding a shortest complete cy

✍ A. Volgenant; R. Jonker; G.A.P. Kindervater 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 329 KB

Tabaris: An exact algorithm based on tab

✍ C. Friden; A. Hertz; D. de Werra 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 809 KB