Classes of submodular constraints expressible by graph cuts (Q606899)
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: Classes of submodular constraints expressible by graph cuts |
scientific article; zbMATH DE number 5817464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Classes of submodular constraints expressible by graph cuts |
scientific article; zbMATH DE number 5817464 |
Statements
Classes of submodular constraints expressible by graph cuts (English)
0 references
19 November 2010
0 references
valued constraint satisfaction problems
0 references
submodular constraints
0 references
minimisation of submodular functions
0 references
min-cut
0 references
pseudo-boolean optimisation
0 references
0 references
0 references
0.8200546503067017
0 references
0.8167269229888916
0 references
0.776473879814148
0 references
0.7732395529747009
0 references
0.7720832228660583
0 references
