Optimally reliable graphs for both edge and vertex failures.
Trefor EvansDerek SmithPublished in: Networks (1986)
Keyphrases
- undirected graph
- vertex set
- weighted graph
- edge weights
- directed graph
- hamiltonian cycle
- minimum weight
- attributed graphs
- strongly connected
- graph structure
- spanning tree
- complex networks
- approximation algorithms
- random graphs
- edge detection
- graph matching
- labeled graphs
- directed acyclic graph
- connected components
- minimum spanning trees
- minimum cost
- average degree
- failure detection
- graph structures
- maximum cardinality
- edge information
- graph theoretic
- bipartite graph
- edge detector
- shortest path
- random walk
- object recognition
- minimum spanning tree
- multiple scales
- graph partitioning
- neural network
- phase transition
- traveling salesman problem
- web pages