A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (Q5297139): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/rsa.20130 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/RSA.20130 / rank | |||
Normal rank | |||
Latest revision as of 16:38, 30 December 2024
scientific article; zbMATH DE number 5172155
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs |
scientific article; zbMATH DE number 5172155 |
Statements
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (English)
0 references
18 July 2007
0 references
graph algorithms
0 references
randomized algorithms
0 references
shortest path
0 references
spanner
0 references
