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

researchr

You are not signed in
Sign in
Sign up

Tsung-Chi Lin, Dyi-Rong Duh. Constructing vertex-disjoint paths in (n, k)-star graphs. Inf. Sci., 178(3):788-801, 2008. [doi]

The following publications are possibly variants of this publication:

Weak-vertex-pancyclicity of (n, k)-star graphsYing-You Chen, Dyi-Rong Duh, Tai-Ling Ye, Jung-Sheng Fu. TCS, 396(1-3):191-199, 2008. [doi]

Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graphChih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang. jcss, 76(8):697-708, 2010. [doi]

runs on WebDSL