(application) | graph colouring - A constraint-satisfaction problem often used
as a test case in research, which also turns out to be
equivalent to certain real-world problems (e.g. register allocation). Given a connected graph and a fixed number of
colours, the problem is to assign a colour to each node,
subject to the constraint that any two connected nodes cannot
be assigned the same colour. This is an example of an
NP-complete problem.See also four colour map theorem. |

Browse

grape-leaf begonia

grapefruit

grapefruit juice

grapefruit peel

Grapeless

grapelike

Grapery

Grapes

Grapeshot

Grapestone

Grapevine

grapevine family

grapey

Graph

Graph Algorithm and Software Package

graph coloring

**-- graph colouring --**

graph paper

graph plotter

graph reduction

graph rewriting system

Graph-Oriented Object Database

grapheme

Graphic

Graphic algebra

Graphic ALGOL

graphic art

graphic artist

Graphic arts

Graphic Display Interface

Graphic formula

Graphic granite

Graphic Language

grapefruit

grapefruit juice

grapefruit peel

Grapeless

grapelike

Grapery

Grapes

Grapeshot

Grapestone

Grapevine

grapevine family

grapey

Graph

Graph Algorithm and Software Package

graph coloring

graph paper

graph plotter

graph reduction

graph rewriting system

Graph-Oriented Object Database

grapheme

Graphic

Graphic algebra

Graphic ALGOL

graphic art

graphic artist

Graphic arts

Graphic Display Interface

Graphic formula

Graphic granite

Graphic Language