Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q3652191)
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: Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems |
scientific article; zbMATH DE number 5649359
| 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 5649359 |
Statements
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems (English)
0 references
17 December 2009
0 references
0.98394113779068
0 references
0.8415418267250061
0 references
0.7985478639602661
0 references
0.7950060367584229
0 references
0.7764145731925964
0 references
