An Efficient Method for Indexing All Topological Orders of a Directed Graph.

Yuma Inoue Shin-ichi Minato

Published in: ISAAC (2014)

Keyphrases

directed graph
pairwise
dynamic programming
neural network
cost function
high accuracy
computationally efficient
information retrieval
objective function
preprocessing
detection method
transition matrix
significant improvement
probabilistic model
binary images