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

• Type: Journal
• Year: 2008
• Where: ISCI
• Authors: Tsung-Chi Lin, Dyi-Rong Duh
• Keywords: Algorithm, General, ISCI 2006, ISCI 2008, Routing