✦ LIBER ✦

Efficient deterministic algorithms for finding optimal cycle bases in undirected graphs

✍ Scribed by Iuliano, Claudio

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient approximation algorithms for s

✍ Andrzej Lingas; Eva-Marta Lundell 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 162 KB

Efficient algorithms for finding minimum

✍ Harold N. Gabow; Zvi Galil; Thomas Spencer; Robert E. Tarjan 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 939 KB

A parallel algorithm for eliminating cyc

✍ Philip Klein; Clifford Stein 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 509 KB

Algorithms for finding an induced cycle

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

An optimal algorithm for finding dominat

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

An Efficient Algorithm for Finding Maxim

✍ Xujin Chen; Wenan Zang 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 284 KB