A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms (Q2456363)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms |
scientific article |
Statements
A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms (English)
0 references
18 October 2007
0 references
\(k\)-connected spanning subgraph
0 references
minimum spanning tree
0 references
randomized approximation algorithm
0 references
distributed algorithm
0 references
probabilistic analysis
0 references
0 references
0 references
0 references
0 references
