✦ LIBER ✦

A revised algorithm for searching for all defective edges in a graph

✍ Scribed by Ting Chen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Searching for an edge in a graph

✍ M. Aigner; E. Triesch 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 484 KB

Efficient algorithm for finding all mini

✍ A. V. Karzanov; E. A. Timofeev 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 524 KB

An algorithm for computing all paths in

✍ Lars-Erik Thorelli 📂 Article 📅 1966 🏛 Springer Netherlands 🌐 English ⚖ 157 KB

Heuristics for Similarity Searching of C

✍ Raymond, J.W.; Gardiner, E.J.; Willett, P. 📂 Article 📅 2002 🏛 American Chemical Society 🌐 English ⚖ 143 KB

A parallel search algorithm for directed

✍ Ratan K. Ghosh; G. P. Bhattacharjee 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 860 KB

A left-first search algorithm for planar

✍ H. de Fraysseix; P. O. de Mendez; J. Pach 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 553 KB