"The Complexity of Computing Minimal Unidirectional Covering Sets."

Dorothea Baumeister et al. (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-13073-1_27

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ciac/BaumeisterBFHR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ciac/BaumeisterBFHR10
Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe:
The Complexity of Computing Minimal Unidirectional Covering Sets. CIAC 2010: 299-310

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.