A recursive formula for the two-edge connected and biconnected reliability of a complete graph.
Thomas LangeManja ReinwardtPeter TittmannPublished in: Networks (2017)
Keyphrases
- weighted graph
- connected components
- undirected graph
- edge weights
- structured data
- random walk
- graph model
- directed acyclic graph
- directed graph
- graph theory
- graph mining
- spanning tree
- graph representation
- edge detection
- vertex set
- graph structure
- shortest path
- graph partitioning
- strongly connected
- edge information
- graph databases
- neighborhood graph
- connected graphs