Four-color-map problem

Article View: sci.image.processing

Article #695

Back to sci.image.processing Previous Next

#695

From: Daniel C. Gnanaprakasam MARL (60...
Date: Thu, 15 Oct 1992 13:18

14 lines
991 bytes

I am looking for a C implementation of the solution to the 
four-color-map problem. The map-coloring problem is defined that one
wants to the color the regions of map in such a way that no two
adjacent regions are of the same color.  The solution was originally
given by Appel K. and Haken W. in Scientific American, Oct 1977.

Thanks
daniel

-- 
Daniel C. Gnanaprakasam                     Phone: (609) 386-5995
Matsushita Applied Research Labs.           Fax  : (609) 386-4999
95D Conneticut Drive	 	           e-mail: daniel@marl.panasonic.com 
Burlington, NJ 08016

Technical Details

Message-ID: <Bw5znE.M0J@adagio.panasonic.com>

Path: arc1-ca.pugleaf.net!sparky!uunet!think.com!ames!elroy.jpl.nasa.gov!nntp-server.caltech.edu!adagio.panasonic.com!daniel

Show Full Headers

Complete Article Headers

Newsgroups: sci.image.processing
Path: arc1-ca.pugleaf.net!sparky!uunet!think.com!ames!elroy.jpl.nasa.gov!nntp-server.caltech.edu!adagio.panasonic.com!daniel
From: daniel@adagio.panasonic.com (Daniel C. Gnanaprakasam MARL (609)386-5995)
Subject: Four-color-map problem
Message-ID: <Bw5znE.M0J@adagio.panasonic.com>
Organization: Panasonic Technologies, Inc. Palo Alto, CA
Date: Thu, 15 Oct 1992 13:18:49 GMT
Lines: 14