Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700)
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 6028453
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems |
scientific article; zbMATH DE number 6028453 |
Statements
Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (English)
0 references
26 April 2012
0 references
divide-and-conquer algorithm
0 references
hypergraph
0 references
multicut
0 references
submodular function
0 references
0.98394113779068
0 references
0.8433515429496765
0 references
0.7996189594268799
0 references
0.7943260669708252
0 references
