Vertex-Magic total labeling of a graph by distributed constraint solving in the mozart system

Authors:
Adam Meissner;Krzysztof Zwierzyński
Affiliations:
Institute of Control and Information Engineering, Poznań University of Technology, Poznań, Poland;Institute of Control and Information Engineering, Poznań University of Technology, Poznań, Poland
Venue:
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Year:
2005

Citing 3
Cited 1

Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
The Oz Programming Model

JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Principles of Constraint Programming

Principles of Constraint Programming

Computing the irregularity strength of connected graphs by parallel constraint solving in the Mozart system

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present how a problem of a vertex-magic total labeling of a graph may be expressed in terms of constraint programming over finite domains (CP(FD)) in the Mozart system. A program representing the problem is easily transformable into a parallel version, which can be executed on distributed machines. We describe the results of experiments for estimating a speedup, a work granularity and an overhead of a parallel version in comparison with sequential computations.