A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (Q5297139)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs |
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
