Login / Signup
Partitions of the edge set of a graph into internally disjoint paths.
Gurusamy Rengasamy Vijayakumar
Published in:
Australas. J Comb. (2007)
Keyphrases
</>
disjoint paths
undirected graph
directed graph
vertex set
small number
graph theory
stable set
gray scale
approximation algorithms
weighted graph
data sets
graph structure
spanning tree
shortest path
dependency graph
edge detection
probability distribution
k means