Improved deterministic algorithms for decremental reachability and strongly connected components (Q2933657)
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 deterministic algorithms for decremental reachability and strongly connected components |
scientific article; zbMATH DE number 6377167
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved deterministic algorithms for decremental reachability and strongly connected components |
scientific article; zbMATH DE number 6377167 |
Statements
Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components (English)
0 references
5 December 2014
0 references
decremental algorithms
0 references
dynamic algorithms
0 references
graph algorithms
0 references
strongly connected components
0 references
transitive closure
0 references
0.8678769469261169
0 references
0.8566204309463501
0 references
0.853085994720459
0 references
0.8489260077476501
0 references
