Cycle embedding in faulty hierarchical cubic networks
Proceedings of the 2002 ACM symposium on Applied computing
Pancycles and hamiltonian-connectedness of the hierarchical cubic network
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
Constructing vertex-disjoint paths in (n, k)-star graphs
Information Sciences: an International Journal
Hi-index | 0.00 |
Abstract: In this paper we propose an efficient parallel implementation of Edmonds' algorithm for finding optimum branchings on a model of the SIMD type with vertical data processing (the STAR-machine). To this end for a directed graph given as a list ...