On maximally distant spanning trees of a graph |
| |
| Authors: | Prof Dr T Kameda |
| |
| Affiliation: | 1. Department of Electrical Engineering, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
|
| |
| Abstract: | A set ofk spanning trees of a graphG is calledmaximally distant if their union contains the maximum number of edges ofG. We present a necessary and sufficient condition for a set of spanning trees to be maximally distant. We also give an efficient algorithm which actually findsk maximally distant spanning trees in a given graph. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
