An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph.
Sukhamay KunduPublished in: ACM Southeast Regional Conference (1982)
Keyphrases
- np hard
- cost function
- theoretical analysis
- high accuracy
- learning algorithm
- recognition algorithm
- dynamic programming
- computational complexity
- improved algorithm
- search space
- experimental evaluation
- expectation maximization
- conflict free
- linear programming
- worst case
- simulated annealing
- computationally efficient
- computational cost
- segmentation algorithm
- detection algorithm
- times faster
- k means
- selection algorithm
- preprocessing
- objective function