Minimum Cut and Minimum <i>k</i> -Cut in Hypergraphs via Branching Contractions (Q6075748)
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 7753164
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum Cut and Minimum <i>k</i> -Cut in Hypergraphs via Branching Contractions |
scientific article; zbMATH DE number 7753164 |
Statements
Minimum Cut and Minimum <i>k</i> -Cut in Hypergraphs via Branching Contractions (English)
0 references
23 October 2023
0 references
hypergraph cut
0 references
minimum cut
0 references
hypergraph connectivity
0 references
\(k\)-cut
0 references
0 references
0.99999976
0 references
0.9337702
0 references
0 references
0.91059506
0 references
0.91024816
0 references
0.9049227
0 references
0.89810914
0 references
0.8963499
0 references
