✦ LIBER ✦

The most vital edges in the minimum spanning tree problem

✍ Scribed by Kao-Chêng Lin; Maw-Sheng Chern

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for finding the mos

✍ Kazuo Iwano; Naoki Katoh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 196 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

The quadratic minimum spanning tree prob

✍ Arjang Assad; Weixuan Xu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 893 KB

On the generalized minimum spanning tree

✍ Young-Soo Myung; Chang-Ho Lee; Dong-Wan Tcha 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 748 KB

On the minimum diameter spanning tree pr

✍ Refael Hassin; Arie Tamir 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 199 KB

The most vital edges of matching in a bi

✍ Chun-Nan Hung; Lih-Hsing Hsu; Ting-Yi Sung 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 373 KB