2681 search results - page 189 / 537 » Problem F |
JCT
2008
13 years 10 months ago
2008
A three-dimensional analogue of the classical direction problem is proposed and an asymptotically sharp bound for the number of directions determined by a nonplanar set in AG(3, p)...
JCT
2006
13 years 10 months ago
2006
Let V be a vector space of dimension v over a field of order q. The q-Kneser graph has the kdimensional subspaces of V as its vertices, where two subspaces and are adjacent if and...
JGAA
2006
13 years 10 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
ENTCS
2007
13 years 10 months ago
2007
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
ARTMED
1999
13 years 10 months ago
1999
The process of reprogramming a cardiac pacemaker can be described in terms similar to those used for describing diagnostic problem solving. In this paper, the process of reprogram...