Combinatorial Persistency Criteria for Multicut and Max-Cut

Lange, Jan-Hendrik; Andres, Bjoern; Swoboda, Paul

doi:10.1109/CVPR.2019.00625

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Combinatorial Persistency Criteria for Multicut and Max-Cut

MPS-Authors

/persons/resource/persons201523

Lange, Jan-Hendrik
Computer Vision and Machine Learning, MPI for Informatics, Max Planck Society;

/persons/resource/persons98382

Andres, Bjoern
Computer Vision and Machine Learning, MPI for Informatics, Max Planck Society;

/persons/resource/persons221924

Swoboda, Paul
Computer Vision and Machine Learning, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Lange, J.-H., Andres, B., & Swoboda, P. (2019). Combinatorial Persistency Criteria for Multicut and Max-Cut. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 6086-6095). Piscataway, NJ: IEEE. doi: 10.1109/CVPR.2019.00625.

引用: https://hdl.handle.net/21.11116/0000-0002-A8E2-1

要旨

要旨はありません