✦ LIBER ✦

Tree edge decomposition with an application to minimum ultrametric tree approximation

✍ Scribed by Chia-Mao Huang; Bang Ye Wu; Chang-Biau Yang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating minimum-cost graph problem

✍ Michel X. Goemans; David P. Williamson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 435 KB

Finding thekmost vital edges with respec

✍ Hong Shen 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 157 KB

Gaps in Convex Disc Packings with an App

✍ Konrad J. Swanepoel 📂 Article 📅 2000 🏛 Springer Vienna 🌐 English ⚖ 119 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

Parallel algorithms for finding the most

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

Timed tree automata with an application

✍ Salvatore La Torre; Margherita Napoli 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 210 KB