Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (Q5899451)
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: Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths |
scientific article; zbMATH DE number 5162687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths |
scientific article; zbMATH DE number 5162687 |
Statements
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (English)
0 references
8 June 2007
0 references
BFS tree
0 references
dynamic
0 references
graph
0 references
transitive closure
0 references
shortest paths
0 references
0.8495845198631287
0 references
0.8466394543647766
0 references
0.8391079306602478
0 references
0.8355382084846497
0 references
