1952 search results - page 144 / 391 » Complete partitions of graphs |
141
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
144
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
157
click to vote
PODS
1993
ACM
15 years 8 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
152
click to vote
FASE
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...
137
click to vote
COMBINATORICS
2000
15 years 4 months ago
2000
In a previous paper it was established that there are at least 27 non-isomorphic strongly regular (40, 12, 2, 4) graphs. Using a different and more efficient method we have re-inv...