✦ LIBER ✦

An optimal algorithm for cycle breaking in directed graphs

✍ Scribed by Tatiana Orenstein; Zvi Kohavi; Irith Pomeranz

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for source location in dire

✍ Mihály Bárász; Johanna Becker; András Frank 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 207 KB

An optimal algorithm for finding dominat

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

An Efficient Parallel Algorithm for Find

✍ M. Furer; B. Raghavachari 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 763 KB

Cyclic games and an algorithm to find mi

✍ V.A. Gurvich; A.V. Karzanov; L.G. Khachivan 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 796 KB

Algorithms for finding an induced cycle

✍ Ken-ichi Kawarabayashi; Yusuke Kobayashi 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 369 KB

An optimal parallel algorithm for planar

✍ Ming-Yang Kao; Shang-Hua Teng; K. Toyama 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 622 KB