A Probabilistic Algorithm for Vertex Connectivity of Graphs.
Michael BeckerW. DegenhardtJürgen DoenhardtStefan HertelGerd KaninkeW. KerberKurt MehlhornStefan NäherHans RohnertThomas WinterPublished in: Inf. Process. Lett. (1982)
Keyphrases
- dynamic programming
- experimental evaluation
- learning algorithm
- optimization algorithm
- worst case
- probabilistic model
- undirected graph
- detection algorithm
- computational complexity
- np hard
- graph structure
- adjacency graph
- simulated annealing
- search space
- significant improvement
- cost function
- computational cost
- recognition algorithm
- graph model
- spanning tree
- hyper graph
- context free parsing
- attributed graphs
- posterior probability
- tree structure
- optimal solution
- social networks