An improved algorithm for incremental DFS tree in undirected graphs (Q5116480)
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: An improved algorithm for incremental DFS tree in undirected graphs |
scientific article; zbMATH DE number 7238971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved algorithm for incremental DFS tree in undirected graphs |
scientific article; zbMATH DE number 7238971 |
Statements
25 August 2020
0 references
DFS tree
0 references
fractional cascading
0 references
fully dynamic algorithm
0 references
0.9175885319709778
0 references
0.9079565405845642
0 references
0.903239130973816
0 references
0.8940324187278748
0 references
0.874267578125
0 references
