Reingold's algorithm for undirected connectivity
GPTKB entity
Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:complexity |
L (deterministic logspace)
|
| gptkbp:field |
computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Reingold's algorithm for undirected connectivity
|
| gptkbp:input |
graph
two vertices |
| gptkbp:namedAfter |
gptkb:Omer_Reingold
|
| gptkbp:output |
whether two vertices are connected
|
| gptkbp:publishedIn |
gptkb:STOC_2005
|
| gptkbp:relatedTo |
graph theory
expander graphs random walks space complexity |
| gptkbp:shows |
SL = L
|
| gptkbp:significance |
first deterministic logspace algorithm for undirected connectivity
|
| gptkbp:solvedBy |
undirected s-t connectivity problem
|
| gptkbp:uses |
logarithmic space
|
| gptkbp:bfsParent |
gptkb:David_Reingold
|
| gptkbp:bfsLayer |
7
|