Acyclic graphoidal covers and path partitions in a graph.
S. ArumugamJ. Suresh SuseelaPublished in: Discret. Math. (1998)
Keyphrases
- connected graphs
- equivalence classes
- graph representation
- solution path
- strongly connected
- graph structure
- shortest path
- path length
- graph theory
- vertex set
- connected components
- directed graph
- shortest path problem
- hamiltonian path
- np complete
- graph theoretic
- graph model
- root node
- endpoints
- weighted graph
- bipartite graph
- structured data
- directed acyclic graph
- data dependencies
- graph mining
- neural network
- mobile robot
- optimal solution
- image segmentation
- clustering algorithm