"A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set ..."

Guillaume Blin, Romeo Rizzi, Stéphane Vialette (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-20712-9_29

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/csr/BlinRV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csr/BlinRV11
Guillaume Blin, Romeo Rizzi, Stéphane Vialette:
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. CSR 2011: 373-384

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.