On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P.

André Große Jörg Rothe Gerd Wechsung

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

Keyphrases

planar graphs
image segmentation
dynamic programming
probabilistic model
least squares
complex networks
undirected graph
minimum weight