search
search
reviewers
reviewers
feeds
feeds
assignments
assignments

settings
logout

The k-Disjoint Paths Problem on Chordal Graphs.

Frank Kammer Torsten Tholey

Published in: WG (2009)

Keyphrases

disjoint paths
undirected graph
directed graph
approximation algorithms
random graphs
connected components
spanning tree
directed acyclic graph
graph structure
minimum cost
complex networks
data sets
pairwise
computational complexity
graph kernels
structured objects
data mining