Computing the Irregularity Strength of Connected Graphs by Parallel Constraint Solving in the Mozart System - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Adam Meissner' in GoogleThis author has not been identified. Look up 'Magdalena Niwinska' in GoogleThis author has not been identified. Look up 'Krzysztof Zwierzynski' in Google

runs on WebDSL