Name
Title | ||
|---|---|---|
Vertex-Magic total labeling of a graph by distributed constraint solving in the mozart system |
Abstract | ||
|---|---|---|
In this paper we present how a problem of a vertex-magic total labeling of a graph may be expressed in terms of constraint programming over finite domains (CP(FD)) in the Mozart system. A program representing the problem is easily transformable into a parallel version, which can be executed on distributed machines. We describe the results of experiments for estimating a speedup, a work granularity and an overhead of a parallel version in comparison with sequential computations. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11752578_115 | PPAM |
Keywords | Field | DocType |
work granularity,sequential computation,finite domain,vertex-magic total,constraint programming,mozart system,parallel version | Constraint satisfaction,Vertex (geometry),Parallel algorithm,Computer science,Constraint programming,Constraint graph,Algorithm,Granularity,Speedup,Constrained optimization | Conference |
Volume | ISSN | ISBN |
3911 | 0302-9743 | 3-540-34141-2 |
Citations | PageRank | References |
2 | 0.61 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adam Meissner | 1 | 24 | 4.70 |
| Krzysztof Zwierzyński | 2 | 4 | 2.08 |