Vertex-magic total labeling of a graph by distributed constraint solving in the Mozart system

Adam Meissner; Krzysztof Zwierzyński

doi:10.1007/11752578_115

Scientific Information System of the Poznań University of Technology

PL EN

Main page / Publications / Vertex-magic total labeling of a graph by distributed constraint solving in the Mozart system

Submit a comment

Chapter

Download BibTeX

Title

Vertex-magic total labeling of a graph by distributed constraint solving in the Mozart system

Authors

Adam Meissner (WE) ^{[ 1 ][ P ]}
Krzysztof Zwierzyński (WE) ^{[ 1 ][ P ]}

^{[ 1 ]} Instytut Automatyki i Inżynierii Informatycznej, Wydział Elektryczny, Politechnika Poznańska | ^{[ P ]} employee

Year of publication

2006

Chapter type

paper

Publication language

english

Abstract

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.

Pages (from - to)

952 - 959

DOI

10.1007/11752578_115

URL

https://link.springer.com/chapter/10.1007/11752578_115

Book

Parallel Processing and Applied Mathematics : 6th International Conference, PPAM 2005, Poznań, Poland, September 11-14, 2005, Revised Selected Papers

Presented on

6th International Conference on Parallel Processing and Applied Mathematics, PPAM 2005, 11-14.09.2005, Poznań, Polska

System created by Poznań University of Technology and Poznan Supercomputing and Networking Center

Log in through eKonto to add to SIS