"Minimum sizes of identifying codes in graphs differing by one edge."

Irène Charon et al. (2014)

> Home

Details and statistics

DOI: 10.1007/S12095-013-0094-X

access: closed

type: Journal Article

metadata version: 2020-04-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ccds/CharonHHL14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ccds/CharonHHL14
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Minimum sizes of identifying codes in graphs differing by one edge. Cryptogr. Commun. 6(2): 157-170 (2014)

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.