5889 search results - page 241 / 1178 » Graph Layout Problems |
166
click to vote
AMAI
2004
Springer
16 years 1 days ago
2004
Springer
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
186
click to vote
EVOW
2001
Springer
15 years 11 months ago
2001
Springer
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
170
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...
163
click to vote
CCCG
2006
15 years 8 months ago
2006
We study the graph partitioning problem on ddimensional ball graphs in a geometric way. Let B be a set of balls in d-dimensional Euclidean space with radius ratio and -precision....
161
click to vote
IMCSIT
2010
15 years 1 months ago
2010
We formulate a novel problem of summarising entities with limited presentation budget on entity-relationship knowledge graphs and propose an efficient algorithm for solving this pr...