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

Tsung-Chi Lin Dyi-Rong Duh

Published in: Inf. Sci. (2008)

Keyphrases

disjoint paths
undirected graph
directed graph
approximation algorithms
spanning tree
graph structure
complex networks
connected components
vertex set
random graphs
average degree
edge weights
minimum cost
directed acyclic graph
data sets
strongly connected
labeled graphs
random walk
neural network