|
⇤ ← Revision 1 as of 2012-11-05 16:07:35
Size: 1563
Comment: Graph Colouring added
|
Size: 1659
Comment: Fix
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 7: | Line 7: |
| A graph is a set of nodes and a symmetric, binary link relation on nodes. Given a set of N colours, a graph is colourable if each node can be assigned a colour in such a way that any two nodes that are linked together cannot have the same colour. | A graph is a set of nodes and a symmetric, binary link relation on nodes. Given a set of N colours, a graph is colourable if each node can be assigned a colour in such a way that any two nodes that are linked together cannot have the same colour. |
| Line 33: | Line 36: |
| == Comment == | == Problem Peculiarities == |
| Line 35: | Line 38: |
| This problem was part of the Second and Third ASP Competition and was proposed by Martin Brain. | '''Type''': Search '''Competition''': System Track '''Complexity''': NP-complete == Notes and updates == Instances taken from last competition (60 instances). |
| Line 39: | Line 48: |
| * Affiliation: Vienna University of Technology, Austria | * Affiliation: DBAI, Vienna University of Technology, Austria |
Graph Colouring
Contents
Problem Description
A graph is a set of nodes and a symmetric, binary link relation on nodes. Given a set of N colours, a graph is colourable if each node can be assigned a colour in such a way that any two nodes that are linked together cannot have the same colour.
Predicates
Input: node/1, link/2, colour/1
Output: chosenColour/2
Input format
A number of node facts which give the names of the nodes. Node names are consecutive, ascending integers starting from 1.
A number of colour facts which give the names of the colours. Colour names start with the sequence "red", "green", "blue".
A number of link facts which say which nodes are linked. Note that if link(N1,N2). is included then so will link(N2,N1).
Output format
A set of choosenColour predicates, one for each node, specifying the node's colour.
Example(s)
Input: node(1). node(2). node(3). link(1,2). link(2,1). link(2,3). link(3,2). link(3,1). link(1,3). colour(red). colour(green). colour(blue).
Output: chosenColour(1,red). chosenColour(2,green). chosenColour(3,blue).
Problem Peculiarities
Type: Search Competition: System Track Complexity: NP-complete
Notes and updates
Instances taken from last competition (60 instances).
Author(s)
- Author: Johannes Wallner
- Affiliation: DBAI, Vienna University of Technology, Austria
- Original Authors: Yuliya Lierler, Marcello Balduccini
- Affiliation: University of Kentucky and Kodak Research Labs