"O(n 3logn) Time Complexity for the Optimal Consensus Set Computation for ..."

Gaëlle Largeteau-Skapin, Rita Zrour, Eric Andres (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-37067-0_21

access: open

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/dgci/Largeteau-SkapinZA13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dgci/Largeteau-SkapinZA13
Gaëlle Largeteau-Skapin, Rita Zrour, Eric Andres:
O(n 3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles. DGCI 2013: 241-252

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.