1. graph coloring graph colouring 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. Graphic ALGOL Generation of shaded perspective picures in real time. ["An Extended ALGOL 60 for Shaded Computer Graphics", B. Jones, Proc ACM Symp on Graphic Languages, Apr 1976]. Graphical Kernel System standard> GKS The widely recognised standard ANSI X3. 124 for graphical input/output. GKS is worked on by the ISO/IEC group JTC1/SC24. It provides applications programmers with standard methods of creating, manipulating, and displaying or printing computer graphics on different types of computer graphics output devices. It provides an abstraction to save programmers from dealing with the detailed capabilities and interfaces of specific hardware. GKS defines a basic two-dimensional graphics system with: uniform input and output primitives; a uniform interface to and from a GKS metafile for storing and transferring graphics information. It supports a wide range of graphics output devices including such as printers, plotters, vector graphics devices, storage tubes, refresh displays, raster displays, and microfilm recorders.
graph coloring |
