Vertex-magic total labeling of a graph by distributed constraint solving in the Mozart system
[ 1 ] Instytut Automatyki i Inżynierii Informatycznej, Wydział Elektryczny, Politechnika Poznańska | [ P ] pracownik
2006
referat
angielski
EN 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.
952 - 959