(GASP) A PL/I extension for programming graph algorithms.
[“GASP – Gprah Algorithm Software Package”, S. Chase, TR CS Dept, U Illinois, Dec 1969].
[graf-uh-loi] /ˈgræf əˌlɔɪ/ noun 1. a compound of impregnated with Babbitt metal, bronze, copper, gold, etc., used as a low-friction material.
graphanesthesia graph·an·es·the·sia (grāf’ān-ĭs-thē’zhə) n. Loss of the ability to recognize figures traced on the skin, as with a pencil-shaped piece of wood.
- Graph coloring
- Graph colouring
application 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 […]