Supermodularity in unweighted graph optimization. III: Highly connected digraphs (Q5219669)
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 7179855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Supermodularity in unweighted graph optimization. III: Highly connected digraphs |
scientific article; zbMATH DE number 7179855 |
Statements
Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs (English)
0 references
12 March 2020
0 references
degree-sequences
0 references
\(k\)-connected digraphs
0 references
connectivity augmentation
0 references
0.7783811688423157
0 references
0.7761523723602295
0 references
0.7761074304580688
0 references
0.7745110392570496
0 references
0.7741173505783081
0 references
