A fast randomized LOGSPACE algorithm for graph connectivity (Q1349893)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 983810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast randomized LOGSPACE algorithm for graph connectivity |
scientific article; zbMATH DE number 983810 |
Statements
A fast randomized LOGSPACE algorithm for graph connectivity (English)
0 references
27 February 1997
0 references
0.9957097768783568
0 references
0.816879391670227
0 references
0.8078546524047852
0 references
