Incremental 2-edge-connectivity in directed graphs (Q4598188)
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 6820238
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Incremental 2-edge-connectivity in directed graphs |
scientific article; zbMATH DE number 6820238 |
Statements
19 December 2017
0 references
2-edge connectivity on directed graphs
0 references
dynamic graph algorithms
0 references
incremental algorithms
0 references
Incremental 2-Edge-Connectivity in Directed Graphs (English)
0 references
0.884229302406311
0 references
0.8592925071716309
0 references
0.8471471071243286
0 references
0.8471471071243286
0 references
0.846886157989502
0 references
