Many-to-many Disjoint Path Covers in a Graph with Faulty Elements.
Jung-Heum ParkHee-Chul KimHyeong-Seok LimPublished in: ISAAC (2004)
Keyphrases
- shortest path
- shortest path problem
- solution path
- graph representation
- random walk
- graph theory
- weighted graph
- strongly connected
- graph structure
- graph based algorithm
- hamiltonian path
- connected components
- graph clustering
- adjacency matrix
- graph partitioning
- graph mining
- directed acyclic graph
- graph matching
- directed graph
- pairwise
- graph model
- path length
- finding the shortest path
- minimum cost path
- bi directional
- graph data
- optimal path
- model based diagnosis
- image segmentation
- bipartite graph
- fault diagnosis
- graphical models
- search algorithm