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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Meissner, A., Niwińska, M., & Zwierzyński, K. (2008). Computing the irregularity strength of connected graphs by parallel constraint solving in the Mozart system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4967 LNCS, pp. 1096–1103). https://doi.org/10.1007/978-3-540-68111-3_116
Mendeley helps you to discover research relevant for your work.