The incremental maintenance of a depth-first-search tree in directed acyclic graphs (Q286984)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6585372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The incremental maintenance of a depth-first-search tree in directed acyclic graphs |
scientific article; zbMATH DE number 6585372 |
Statements
The incremental maintenance of a depth-first-search tree in directed acyclic graphs (English)
0 references
26 May 2016
0 references
analysis of algorithms
0 references
design of algorithms
0 references
depth-first search tree
0 references
0.870050311088562
0 references
0.8686206340789795
0 references
0.866004228591919
0 references
0.8572832942008972
0 references
0.821260929107666
0 references
