Login / Signup

On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach.

Vikraman ArvindChristine T. ChengNikhil R. Devanur
Published in: SIAM J. Discret. Math. (2008)
Keyphrases
  • planar graphs
  • higher order
  • minimum weight
  • pairwise
  • dynamic programming
  • edge detection
  • greedy algorithm
  • weighted graph