Adam Meissner, Magdalena Niwinska, Krzysztof Zwierzynski. Computing the Irregularity Strength of Connected Graphs by Parallel Constraint Solving in the Mozart System. In Roman Wyrzykowski, Jack Dongarra, Konrad Karczewski, Jerzy Wasniewski, editors, Parallel Processing and Applied Mathematics, 7th International Conference, PPAM 2007, Gdansk, Poland, September 9-12, 2007, Revised Selected Papers. Volume 4967 of Lecture Notes in Computer Science, pages 1096-1103, Springer, 2007. [doi]
@inproceedings{MeissnerNZ07,
title = {Computing the Irregularity Strength of Connected Graphs by Parallel Constraint Solving in the Mozart System},
author = {Adam Meissner and Magdalena Niwinska and Krzysztof Zwierzynski},
year = {2007},
doi = {10.1007/978-3-540-68111-3_116},
url = {http://dx.doi.org/10.1007/978-3-540-68111-3_116},
tags = {constraints, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/MeissnerNZ07},
cites = {0},
citedby = {0},
pages = {1096-1103},
booktitle = {Parallel Processing and Applied Mathematics, 7th International Conference, PPAM 2007, Gdansk, Poland, September 9-12, 2007, Revised Selected Papers},
editor = {Roman Wyrzykowski and Jack Dongarra and Konrad Karczewski and Jerzy Wasniewski},
volume = {4967},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-68105-2},
}