A fully dynamic reachability algorithm for directed graphs with an almost linear update time (Q3580968)
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: A fully dynamic reachability algorithm for directed graphs with an almost linear update time |
scientific article; zbMATH DE number 5770707
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fully dynamic reachability algorithm for directed graphs with an almost linear update time |
scientific article; zbMATH DE number 5770707 |
Statements
A fully dynamic reachability algorithm for directed graphs with an almost linear update time (English)
0 references
15 August 2010
0 references
0.9942548274993896
0 references
0.917138934135437
0 references
0.8683085441589355
0 references
0.8681745529174805
0 references
