Randomized minimum spanning tree algorithms using exponentially fewer random bits (Q4962697): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1328911.1328916 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992273661 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:14, 19 March 2024
scientific article; zbMATH DE number 6972855
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomized minimum spanning tree algorithms using exponentially fewer random bits |
scientific article; zbMATH DE number 6972855 |
Statements
Randomized minimum spanning tree algorithms using exponentially fewer random bits (English)
0 references
5 November 2018
0 references
graph algorithms
0 references
minimum spanning trees
0 references
random sampling
0 references
