5473 search results - page 200 / 1095 » On the graph isomorphism problem |
195
click to vote
IAT
2005
IEEE
16 years 24 days ago
2005
IEEE
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...
212
click to vote
ICIP
1998
IEEE
15 years 11 months ago
1998
IEEE
1 In this paper, the segmentation problem is formulated as a problem of segmenting a Riemannian manifold. The image domain is endowed with an anisotropic metric and its segmentatio...
178
click to vote
CCCG
2008
15 years 8 months ago
2008
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...
179
click to vote
TCS
2008
15 years 7 months ago
2008
Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this problem: the original paper...
205
click to vote
FAW
2009
Springer
16 years 1 months ago
2009
Springer
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...