Login / Signup

Minimal identifying codes in trees and planar graphs with large girth.

David Auger
Published in: Eur. J. Comb. (2010)
Keyphrases
  • knapsack problem
  • planar graphs
  • dynamic programming
  • decision trees
  • social networks
  • special case
  • random walk
  • minimum weight