Incremental algorithm for minimum cut and edge connectivity in hypergraph (Q2301748)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Incremental algorithm for minimum cut and edge connectivity in hypergraph |
scientific article; zbMATH DE number 7173535
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Incremental algorithm for minimum cut and edge connectivity in hypergraph |
scientific article; zbMATH DE number 7173535 |
Statements
Incremental algorithm for minimum cut and edge connectivity in hypergraph (English)
0 references
25 February 2020
0 references
hypergraph
0 references
minimum cut
0 references
edge connectivity
0 references
hypercactus
0 references
0.8137246370315552
0 references
0.8081788420677185
0 references
0.7994763851165771
0 references
0.7926385402679443
0 references
