A Self-Stabilizing Algorithm for Coloring Planar Graphs.

Sukumar Ghosh Mehmet Hakan Karaata

Published in: Distributed Comput. (1993)

Keyphrases

objective function
computational complexity
dynamic programming
linear programming
k means
worst case
planar graphs
lower bound
np hard
expectation maximization