Influence of the tie-break rule on the end-vertex problem (Q2928580)
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: Influence of the tie-break rule on the end-vertex problem |
scientific article; zbMATH DE number 6367130
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Influence of the tie-break rule on the end-vertex problem |
scientific article; zbMATH DE number 6367130 |
Statements
10 November 2014
0 references
graph algorithms
0 references
graph search
0 references
end-vertex problem
0 references
BFS
0 references
DFS
0 references
LBFS
0 references
LDFS
0 references
Influence of the tie-break rule on the end-vertex problem (English)
0 references
0.8512832522392273
0 references
0.8341396450996399
0 references
0.8331177234649658
0 references
0.8042067885398865
0 references
0.779992401599884
0 references
