A New Efficient Algorithm for Generating All Minimal Tie-Sets Connecting Selected Nodes in a Mesh-Structured Network.
Janusz MalinowskiPublished in: IEEE Trans. Reliab. (2010)
Keyphrases
- dynamic programming
- single pass
- learning algorithm
- worst case
- expectation maximization
- computationally efficient
- objective function
- preprocessing
- fully connected
- high efficiency
- optimal solution
- computational complexity
- detection algorithm
- network structure
- finding the shortest path
- delaunay triangulation
- spanning tree
- matching algorithm
- similarity measure
- weighted graph
- path length
- cost function
- maximum flow