Login / Signup

Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs.

Gholamreza AbrishamiFreydoon Rahbarnia
Published in: Inf. Process. Lett. (2018)
Keyphrases
  • planar graphs
  • worst case
  • computational complexity
  • optimal solution
  • k means
  • dynamic programming
  • np hard
  • probabilistic model
  • expectation maximization
  • closed form
  • knapsack problem
  • randomized algorithm