Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier (Q4575631)
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 6903929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier |
scientific article; zbMATH DE number 6903929 |
Statements
Dynamic DFS in Undirected Graphs: breaking the O(<i>m</i>) barrier (English)
0 references
16 July 2018
0 references
0.9764261841773988
0 references
0.8946049213409424
0 references
0.8940324187278748
0 references
0.8729800581932068
0 references
0.8583213090896606
0 references
