Computing the Irregularity Strength of Connected Graphs by Parallel Constraint Solving in the Mozart System.
Adam MeissnerMagdalena NiwinskaKrzysztof ZwierzynskiPublished in: PPAM (2007)
Keyphrases
- constraint solving
- constraint propagation
- constraint logic programming
- constraint satisfaction problems
- constraint solver
- connected graphs
- constraint programming
- constraint satisfaction
- parallel implementation
- finite domain
- image sequences
- parallel processing
- image processing
- image segmentation
- data structure
- knowledge representation