The Giant Component Threshold for Random Regular Graphs with Edge Faults.
Andreas GoerdtPublished in: MFCS (1997)
Keyphrases
- weighted graph
- undirected graph
- fault diagnosis
- edge detection
- edge information
- edge detector
- minimum spanning trees
- graph databases
- graph matching
- software components
- fault model
- directed graph
- connected components
- graph theory
- graph partitioning
- threshold selection
- gray value
- graph theoretic
- graph representation
- fault detection
- model based diagnosis
- graph mining
- spanning tree
- edge weights
- graph clustering
- pattern mining