Login / Signup

Complexity of metric dimension on planar graphs.

Josep DíazOlli PottonenMaria J. SernaErik Jan van Leeuwen
Published in: J. Comput. Syst. Sci. (2017)
Keyphrases
  • planar graphs
  • computational complexity
  • semi supervised
  • graph cuts
  • stereo matching