Complexity results for identifying codes in planar graphs.

David Auger Irène Charon Olivier Hudry Antoine Lobstein

Published in: Int. Trans. Oper. Res. (2010)

Keyphrases

planar graphs
computational complexity
worst case
edge detection
maximum likelihood