An algorithm for finding a large independent set in planar graphs.

Norishige Chiba Takao Nishizeki Nobuji Saito

Published in: Networks (1983)

Keyphrases

computational complexity
objective function
independent set
worst case
maximum weight
np hard
dynamic programming
segmentation algorithm
convex hull
social networks
linear programming
random walk
tree structure
closed form
greedy algorithm
planar graphs