Login / Signup

Heuristics for Rapidly Four-Coloring Large Planar Graphs.

Craig A. MorgensternHenry D. Shapiro
Published in: Algorithmica (1991)
Keyphrases
  • planar graphs
  • search algorithm
  • minimum weight
  • approximate inference
  • greedy heuristic
  • traveling salesman problem
  • random fields
  • undirected graph