"DS++: a flexible, scalable and provably tight relaxation for matching ..."

Nadav Dym, Haggai Maron, Yaron Lipman (2017)

> Home

Details and statistics

DOI: 10.1145/3130800.3130826

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tog/DymML17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tog/DymML17
Nadav Dym, Haggai Maron, Yaron Lipman:
DS++: a flexible, scalable and provably tight relaxation for matching problems. ACM Trans. Graph. 36(6): 184:1-184:14 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.