One-to-many node-disjoint paths in (n, k)-star graphs.

Yonghong Xiang Iain A. Stewart

Published in: Discret. Appl. Math. (2010)

Keyphrases

disjoint paths
undirected graph
directed graph
approximation algorithms
graph structure
random walk
directed acyclic graph
minimum cost
random graphs
graph matching
graph structures
complex networks
graph theory
graph theoretic
strongly connected
bipartite graph
edge weights