An approximation algorithm for the maximum independent set problem in cubic planar graphs.

Elarbi Choukhmane John Franco

Published in: Networks (1986)

Keyphrases

np hard
dynamic programming
expectation maximization
computational complexity
search space
planar graphs
energy function
closed form
knapsack problem
maximum weight