Building k edge-disjoint spanning trees of minimum total length for isometric data embedding | IEEE Journals & Magazine | IEEE Xplore