Semi-dynamic breadth-first search in digraphs (Q1589436)
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 1542265
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semi-dynamic breadth-first search in digraphs |
scientific article; zbMATH DE number 1542265 |
Statements
Semi-dynamic breadth-first search in digraphs (English)
0 references
12 December 2000
0 references
breadth-first search tree
0 references
incremental algorithms
0 references
decremental algorithms
0 references
shortest paths
0 references
amortized analysis
0 references
0.9715719
0 references
0.8794018
0 references
0.87175286
0 references
0.8660693
0 references
0.8651755
0 references
0 references
0 references
0.8644254
0 references
