✦ LIBER ✦

Computing the 2-median on tree networks in O(n lg n) time

✍ Scribed by Bezalel Gavish; Suresh Sridhar

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

O(n2.5) time algorithms for the subgraph

✍ Moon Jung Chung 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Computation of geometric properties from

✍ Angela Y Wu 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 93 KB

Wavelength dependence of the BaO* produc

✍ Henk Jalink; Steven Stolte; David H. Parker 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 542 KB

Impact of furnace nitridation time in N2

✍ R. Le Bihan; E. André-Benoit; C. Papadas; F. Pio; C. Riva 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 397 KB

Using the decomposition-tree of a networ

📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 136 KB

A method for the separate computation of

✍ Klaus-Peter Schröder 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 894 KB