AN APPLICATION OF DYNAMIC PROGRAMMING TO THE COLORING OF MAPS

Abstract

The four-color problem is extended and inverted. The method is a combination of exact and heuristic techniques. Conceivably, it may offer an approach to some general theoretical results. At the moment, it is designed to resolve the problem of how a particular map is to be colored with three or four colors. In general, the computational procedure given requires a digital computer.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1964
Accession Number
AD0601077

Entities

People

  • Richard E. Bellman

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Computer Programming
  • Computers
  • Corporations
  • Digital Computers
  • Dynamic Programming
  • Experimental Design
  • Mathematics
  • Periodicals

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Human-Computer Interaction (HCI).
  • Operations Research