A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (Q5297139): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/rsa.20130 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/rsa.20130 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4231761369 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel linear programming in fixed dimension almost surely in constant time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms – ESA 2005 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of network synchronization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: STACS 2005 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2921727 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3852212 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4471324 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2921725 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A trade-off between space and efficiency for routing tables / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Automata, Languages and Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms – ESA 2004 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximate distance oracles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Spanners and emulators with sublinear distance errors / rank | |||
Normal 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
