Skip to main content
University of Oxford Department of Computer Science
  Contact Us     Search  
  1. Home
  2. Research
  3. Algorithms and Complexity Theory
  4. Classes of submodular constraints expressible by graph cuts

Classes of submodular constraints expressible by graph cuts

Stanislav Živný and Peter G. Jeavons

Journal
Constraints
Number
3
Pages
430−452
Volume
15
Year
2010

Links

See Also

Back to Top