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
Constructing independent spanning trees for locally twisted cubes
Theoretical Computer Science
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing
On identifying additive link metrics using linearly independent cycles and paths
IEEE/ACM Transactions on Networking (TON)
A counterexample for the proof of implication conjecture on independent spanning trees
Information Processing Letters
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
The Journal of Supercomputing
Hi-index | 0.89 |