Author:
Choudum S. A.,Lavanya S.,Sunitha V.
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Science Applications
Reference9 articles.
1. Spanning multi-paths in hypercubes
2. Dvořák, T., Gregor, P. and Koubek, V. Spanning paths in hypercubes. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb ’05), DMTCS Proceedings. Edited by: Felsner, S. pp.363–368. Discrete Mathematics and Theoretical Computer Science.
3. Gonzalez, T. F. and Serena, D. Complexity of k-pairwise disjoint shortest paths in the undirected hyprecubic network and related problems. Proceedings of the International Conference on Parallel and Distributed Computing and Systems, PDCS. Canada. IASTED, Acta Press.
4. n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献