Speeding up dynamic transitive closure for bounded degree graphs (Q1323330)
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: Speeding up dynamic transitive closure for bounded degree graphs |
scientific article; zbMATH DE number 567296
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Speeding up dynamic transitive closure for bounded degree graphs |
scientific article; zbMATH DE number 567296 |
Statements
Speeding up dynamic transitive closure for bounded degree graphs (English)
0 references
30 June 1994
0 references
path finding algorithm
0 references
transitive closure
0 references
digraph
0 references
0.8966795
0 references
0.8965359
0 references
0.8873831
0 references
0.8871968
0 references
0.87666285
0 references
0.8763033
0 references
0.87629545
0 references
