Name
Title | ||
|---|---|---|
Computing the irregularity strength of connected graphs by parallel constraint solving in the Mozart system |
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-68111-3_116 | PPAM |
Keywords | Field | DocType |
iterative best-solution search,programming methodology,connected graph,parallel processing,parallel computation,irregularity strength,parallel constraint,optimization task,mozart system,branch-and-bound method,mozart,parallel computer | Strength of a graph,Graph,Computer science,Parallel processing,Theoretical computer science,Software development process,MOZART,Speedup,Computation | Conference |
Volume | ISSN | ISBN |
4967 | 0302-9743 | 3-540-68105-1 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adam Meissner | 1 | 24 | 4.70 |
| Magdalena Niwińska | 2 | 0 | 0.68 |
| Krzysztof Zwierzyński | 3 | 4 | 2.08 |