Completely Independent Spanning Trees in Maximal Planar Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Parallel construction of optimal independent spanning trees on hypercubes
Parallel Computing
On the independent spanning trees of recursive circulant graphs G(cdm,d) with d2
Theoretical Computer Science
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
Information Processing Letters
Constructing independent spanning trees for locally twisted cubes
Theoretical Computer Science
Independent spanning trees on even networks
Information Sciences: an International Journal
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
Discrete Applied Mathematics
Optimal Independent Spanning Trees on Odd Graphs
The Journal of Supercomputing
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing
| Hi-index | 0.05 |