On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups.
Cheng-Nan LaiPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- approximation algorithms
- graph structure
- spanning tree
- connected components
- random graphs
- directed acyclic graph
- minimum cost
- complex networks
- labeled graphs
- random walk
- graph matching
- attributed graphs
- vertex set
- probabilistic model
- graph databases
- edge weights
- binary images