Incremental algorithm for maintaining a DFS tree for undirected graphs (Q2408922)
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: Incremental algorithm for maintaining a DFS tree for undirected graphs |
scientific article; zbMATH DE number 6789044
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Incremental algorithm for maintaining a DFS tree for undirected graphs |
scientific article; zbMATH DE number 6789044 |
Statements
Incremental algorithm for maintaining a DFS tree for undirected graphs (English)
0 references
10 October 2017
0 references
dynamic
0 references
incremental
0 references
undirected graph
0 references
depth first search
0 references
0.9664297699928284
0 references
0.874267578125
0 references
0.8257667422294617
0 references
0.8233658671379089
0 references
0.8150679469108582
0 references
