An Algorithm for Transitive Reduction of an Acyclic Graph.
David GriesAlain J. MartinJan L. A. van de SnepscheutJan Tijmen UddingPublished in: Sci. Comput. Program. (1989)
Keyphrases
- detection algorithm
- learning algorithm
- significant improvement
- optimization algorithm
- np hard
- dynamic programming
- np complete
- graph based algorithm
- graph model
- recognition algorithm
- worst case
- cost function
- preprocessing
- graph structure
- polynomial time complexity
- similarity measure
- reduction method
- shortest path problem
- computational cost
- tree structure
- k means
- special case
- probabilistic model
- matching algorithm
- weighted graph
- objective function
- graph partitioning
- maximum flow
- genetic algorithm