✦ LIBER ✦

Efficient determination of the k most vital edges for the minimum spanning tree problem

✍ Scribed by Cristina Bazgan; Sonia Toubaline; Daniel Vanderpooten

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The most vital edges in the minimum span

✍ Kao-Chêng Lin; Maw-Sheng Chern 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 490 KB

Efficient algorithms for finding the mos

✍ Kazuo Iwano; Naoki Katoh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Parallel algorithms for finding the most

✍ Lih-Hsing Hsu; Peng-Fei Wang; Chu-Tao Wu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 1015 KB

Finding the most vital edge with respect

✍ Lih-Hsing Hsu; Rong-Hong Jan; Yu-Che Lee; Chun-Nan Hung; Maw-Sheng Chern 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 557 KB

On the inverse minimum spanning tree pro

✍ Bangyi Li; Zhaohan Sheng 📂 Article 📅 2003 🏛 SP Systems Engineering Society of China 🌐 English ⚖ 228 KB

Critical edges/nodes for the minimum spa

✍ Cristina Bazgan, Sonia Toubaline… 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 487 KB