BibTeX record journals/tcs/CharonHL03

download as .bib file

@article{DBLP:journals/tcs/CharonHL03,
  author       = {Ir{\`{e}}ne Charon and
                  Olivier Hudry and
                  Antoine Lobstein},
  title        = {Minimizing the size of an identifying or locating-dominating code
                  in a graph is NP-hard},
  journal      = {Theor. Comput. Sci.},
  volume       = {290},
  number       = {3},
  pages        = {2109--2120},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00536-4},
  doi          = {10.1016/S0304-3975(02)00536-4},
  timestamp    = {Wed, 17 Feb 2021 21:58:18 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CharonHL03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.