A Fast Probabilistic Algorithm for Four-Coloring Large Planar Graphs.

Raymond A. Archuleta Henry D. Shapiro

Published in: FJCC (1986)

Keyphrases

optimal solution
dynamic programming
probabilistic model
worst case
planar graphs
computational complexity
k means
linear programming
closed form
knapsack problem
bayesian networks
expectation maximization
tree structure
max cut