✦ LIBER ✦

Efficient approximation algorithms for shortest cycles in undirected graphs

✍ Scribed by Andrzej Lingas; Eva-Marta Lundell

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Faster Algorithms for All-pairs Approxim

✍ Baswana, Surender; Kavitha, Telikepalli 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 526 KB

A parallel algorithm for eliminating cyc

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

A note on finding a shortest complete cy

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

Efficient algorithms for finding minimum

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

Efficient parallel algorithms for comput

✍ Yijie Han; V. Y. Pan; J. H. Reif 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 820 KB

Dynamic algorithms for shortest paths in

✍ Esteban Feuerstein; Alberto Marchetti-Spaccamela 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 887 KB