Computation of lucky number of planar graphs is NP-hard.

Arash Ahadi Ali Dehghan Mohammad Reza Kazemi E. Mollaahmadi

Published in: Inf. Process. Lett. (2012)

Keyphrases

np hard
computational complexity
optimal solution
pairwise
graph cuts
message passing