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

Authors:
Adam Meissner;Magdalena Niwińska;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;Institute of Control and Information Engineering, Poznań University of Technology, Poznań, Poland
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 3
Cited 0

Irregular assignments of trees and forests

SIAM Journal on Discrete Mathematics
Principles of Constraint Programming

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

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we show how the problem of computing the irregularity strength of a graph can be expressed in terms of CP(FD) programming methodology and solved by parallel computations in the Mozart system. We formulate this problem as an optimization task and apply the branch-and-bound method and iterative best-solution search in order to solve it. Both of these approaches have been evaluated in experiments. We also estimate the speedup obtained by parallel processing.