Sciweavers

Share
ISCI
2008

Constructing vertex-disjoint paths in (n, k)-star graphs

9 years 7 months ago
Constructing vertex-disjoint paths in (n, k)-star graphs
This work develops a novel general routing algorithm, which is a routing function, for constructing a container of width n1 between any pair of vertices in an (n, k)-star graph with
Tsung-Chi Lin, Dyi-Rong Duh
Added 27 Dec 2010
Updated 27 Dec 2010
Type Journal
Year 2008
Where ISCI
Authors Tsung-Chi Lin, Dyi-Rong Duh
Comments (0)
books