The giant component threshold for random regular graphs with edge faults H. Prodinger.
Andreas GoerdtPublished in: Theor. Comput. Sci. (2001)
Keyphrases
- weighted graph
- undirected graph
- minimum spanning trees
- fault diagnosis
- edge detection
- gray value
- graph theory
- graph partitioning
- edge detector
- threshold selection
- graph structure
- graph theoretic
- spanning tree
- test cases
- software components
- graph matching
- connected components
- model based diagnosis
- strongly connected
- adjacency graph
- graph construction
- neural network
- graph data
- multiscale
- edge information
- structured data
- software systems