Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs (Q3452820)
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 6511801
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs |
scientific article; zbMATH DE number 6511801 |
Statements
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (English)
0 references
19 November 2015
0 references
0 references
0.8676714897155762
0 references
0.8388451337814331
0 references
0.836559534072876
0 references
0.8352245092391968
0 references
0.8307408690452576
0 references
