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
Disjoint path covers in recursive circulants G(2m,4) with faulty elements
Theoretical Computer Science
Hi-index | 0.89 |