"Complexity results for identifying codes in planar graphs."

David Auger et al. (2010)

> Home

Details and statistics

DOI: 10.1111/J.1475-3995.2009.00750.X

access: closed

type: Journal Article

metadata version: 2020-07-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/itor/AugerCHL10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/itor/AugerCHL10
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
Complexity results for identifying codes in planar graphs. Int. Trans. Oper. Res. 17(6): 691-710 (2010)

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.