Node-disjoint Paths in a Transposition Graph.

Yasuto Suzuki Keiichi Kaneko Mario Nakamori

Published in: PDPTA (2004)

Keyphrases

disjoint paths
approximation algorithms
directed graph
undirected graph
graph structure
special case
np hard
random walk
spanning tree
directed acyclic graph
graph model
minimum cost
strongly connected
binary images
connected components
social networks
worst case
knn
root node