A bidirectional shortest-path algorithm with good average-case behavior (Q1823692)
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 bidirectional shortest-path algorithm with good average-case behavior |
scientific article; zbMATH DE number 4115973
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bidirectional shortest-path algorithm with good average-case behavior |
scientific article; zbMATH DE number 4115973 |
Statements
A bidirectional shortest-path algorithm with good average-case behavior (English)
0 references
1989
0 references
probabilistic analysis
0 references
two-terminal shortest-path problem
0 references
bidirectonal search algorithm
0 references
0 references
0.8735752
0 references
0.8659951
0 references
0.86191297
0 references
0.85235304
0 references
0.8521743
0 references
0.84993994
0 references
0.84853673
0 references
