402 search results - page 17 / 81 » On Finding the Number of Graph Automorphisms |
CF
2006
ACM
13 years 9 months ago
2006
ACM
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
ESA
1998
Springer
13 years 12 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
ICMCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Image segmentation has been studied for many years. But what factors influence segmentation results indeed? Why some images are easy to be handled while the others are not? In thi...
AAAI
2007
13 years 10 months ago
2007
A natural representation of data is given by the parameters which generated the data. If the space of parameters is continuous, then we can regard it as a manifold. In practice, w...
ALGORITHMICA
2010
13 years 6 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...