Connectivity algorithms (Q4635968)
From MaRDI portal
!
WARNING
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 6863586
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connectivity algorithms |
scientific article; zbMATH DE number 6863586 |
Statements
23 April 2018
0 references
edge connectivity
0 references
vertex connectivity
0 references
flow-based algorithms
0 references
Gomory-Hu tree
0 references
0.8315819501876831
0 references
0.8074339032173157
0 references
0.8043010234832764
0 references
