✦ LIBER ✦
Building k edge-disjoint spanning trees of minimum total length for isometric data embedding
✍ Scribed by Li Yang
- Book ID
- 117931226
- Publisher
- IEEE
- Year
- 2005
- Tongue
- English
- Weight
- 574 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0162-8828
No coin nor oath required. For personal study only.