On Partitioning the Edge Set of a Graph into Internally Disjoint Paths without Exterior Vertices.
Gurusamy Rengasamy VijayakumarPublished in: Graphs Comb. (2011)
Keyphrases
- disjoint paths
- undirected graph
- vertex set
- weighted graph
- directed graph
- edge weights
- minimum cost
- labeled graphs
- graph partitioning
- data structure
- approximation algorithms
- hamiltonian cycle
- graph connectivity
- partitioning algorithm
- dependency graph
- random graphs
- edge information
- bipartite graph
- structured data
- computational complexity