Decremental data structures for connectivity and dominators in directed graphs (Q5111373)
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: Decremental data structures for connectivity and dominators in directed graphs |
scientific article; zbMATH DE number 7204494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decremental data structures for connectivity and dominators in directed graphs |
scientific article; zbMATH DE number 7204494 |
Statements
27 May 2020
0 references
dynamic graph algorithms
0 references
decremental algorithms
0 references
dominator tree
0 references
strong connectivity under failures
0 references
0.8720160722732544
0 references
0.8168433904647827
0 references
0.8160643577575684
0 references
0.8127288222312927
0 references
0.8093751072883606
0 references
