✦ LIBER ✦

AnO(n2) algorithm for finding the compact sets of a graph

✍ Scribed by Chiou-Kuo Liang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for finding the compact

✍ Dejan Zivkovic 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 407 KB

An n2 algorithm for determining the brid

✍ D.G. Corneil 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 546 KB

An efficient algorithm for finding a max

✍ Ju Yuan Hsiao; Chuan Yi Tang; Ruay Shiung Chang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 606 KB

An algorithm for finding the essential s

✍ Pierre Robert 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 481 KB

An algorithm for finding the minimum ske

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

A local algorithm for finding the bicomp

✍ V.A. Evstigneev 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 368 KB