A Heuristic Strong Connectivity Algorithm for Large Graphs.
Adan Cosgaya-LozanoNorbert ZehPublished in: SEA (2009)
Keyphrases
- dynamic programming
- times faster
- detection algorithm
- worst case
- search algorithm
- search space
- k means
- segmentation algorithm
- graph structure
- search procedure
- undirected graph
- optimization algorithm
- particle swarm optimization
- linear programming
- simulated annealing
- probabilistic model
- cost function
- preprocessing
- computational complexity
- exact algorithms
- packing problem
- graph clustering
- graph partitioning
- bin packing
- finding the shortest path
- expectation maximization
- bipartite graph
- graph matching
- matching algorithm
- clustering method
- learning algorithm
- computational cost
- np hard
- optimal solution
- similarity measure