✦ LIBER ✦

A fast method for topological observability analysis using a minimum spanning tree technique

✍ Scribed by Mori, H.; Tsuzuki, S.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for the minimum spannin

✍ Francis Suraweera 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 408 KB

A fast distributed approximation algorit

✍ Maleq Khan; Gopal Pandurangan 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 271 KB

A Memory Adaptive Reasoning Technique fo

✍ R. Patterson; H. Pirkul; E. Rolland 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 108 KB

A branch and cut method for the degree-c

✍ L. Caccetta; S.P. Hill 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 2 views

A new algorithm for degree-constrained m

✍ Aibing Ning; Liang Ma; Xiaohua Xiong 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 163 KB

A comparative analysis of several formul

✍ Corinne Feremans; Martine Labbé; Gilbert Laporte 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 423 KB 👁 1 views