A polynomial-time algorithm for computing K-terminal residual reliability of d-trapezoid graphs.
Min-Sheng LinChao-Chun TingPublished in: Inf. Process. Lett. (2015)
Keyphrases
- worst case
- computational complexity
- polynomial time complexity
- learning algorithm
- matching algorithm
- detection algorithm
- dynamic programming
- preprocessing
- optimal solution
- graph isomorphism
- linear programming
- graph cuts
- adjacency graph
- recognition algorithm
- np hard
- probabilistic model
- significant improvement
- undirected graph
- objective function
- genetic algorithm
- planar graphs
- graph search
- random graphs
- graph model
- graph structure
- similarity measure
- optimization algorithm
- segmentation algorithm
- np complete
- simulated annealing
- cost function