On uniformly optimally reliable graphs for pair-connected reliability with vertex failures.
Ashok T. AminKyle SiegristPeter J. SlaterPublished in: Networks (1993)
Keyphrases
- undirected graph
- directed graph
- failure rate
- labeled graphs
- attributed graphs
- series parallel
- connected components
- hamiltonian cycle
- connected subgraphs
- high reliability
- graph matching
- strongly connected
- neighborhood graph
- graph theoretic
- cost effective
- highly reliable
- connected graphs
- maximum cardinality
- edge weights
- graph representation
- pairwise
- graph mining
- graph theory
- average degree
- minimum spanning tree
- neural network
- graph clustering
- vertex set
- phase transition
- root cause
- minimum weight
- similarity scores
- reliability analysis
- subgraph isomorphism
- graph structures
- random graphs
- graph databases
- weighted graph
- graph structure
- traveling salesman problem
- random walk
- pattern recognition
- image segmentation