5473 search results - page 662 / 1095 » On the graph isomorphism problem |
172
click to vote
ICEC
1994
15 years 8 months ago
1994
In this paper, we propose an algorithm for the channel routing problem based on genetic approach that uses a new type of mutation, called inter-cluster mutation . The performance ...
222
click to vote
CIMAGING
2009
15 years 8 months ago
2009
We introduce "contour stencils" as a simple method for detecting the local orientation of image contours and apply this detection to image zooming. Our approach is motiv...
163
click to vote
ARSCOM
2007
15 years 7 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
187
click to vote
BIODATAMINING
2008
15 years 7 months ago
2008
The analysis and interpretation of relationships between biological molecules, networks and concepts is becoming a major bottleneck in systems biology. Very often the pure amount ...
127
click to vote
CACM
2008
15 years 7 months ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...