A Aralex Aachen research explorer

June 01, 2007 article

Minimizing Nonsubmodular Functions with Graph Cuts-A Review

IEEE Transactions on Pattern Analysis and Machine Intelligence

DOI: 10.1109/tpami.2007.1031 OpenAlex

Authors 0

Author list not loaded yet.

Cited by 1 stored of 368

Persistency of Linear Programming Relaxations for the Stable Set Problem
2020 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs Open access

2

citations

1 result

References 0