A topological sorting algorithm for large graphs.
Deepak AjwaniAdan Cosgaya-LozanoNorbert ZehPublished in: ACM J. Exp. Algorithmics (2011)
Keyphrases
- detection algorithm
- theoretical analysis
- cost function
- learning algorithm
- high accuracy
- computational cost
- experimental evaluation
- optimal solution
- dynamic programming
- recognition algorithm
- times faster
- computational complexity
- simulated annealing
- worst case
- search space
- input data
- particle swarm optimization
- graph structure
- k means
- np hard
- max cut
- random graphs
- graph clustering
- bipartite graph
- graph matching
- convergence rate
- optimization algorithm
- expectation maximization
- linear programming
- objective function