Finding Independent Spanning Trees in Partial k-Trees
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
An efficient parallel construction of optimal independent spanning trees on hypercubes
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |