3268 search results - page 226 / 654 » The hub number of a graph |
172
click to vote
GD
2004
Springer
15 years 12 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
144
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
198
click to vote
CVPR
1999
IEEE
15 years 11 months ago
1999
IEEE
We address the problem of detection and tracking of moving objects in a video stream obtained from a moving airborne platform. The proposed method relies on a graph representation...
188
click to vote
SSD
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. Knowledge discovery in databases (KDD) is an important task in spatial databases since both, the number and the size of such databases are rapidly growing. This paper int...
179
click to vote
VLDB
1993
ACM
15 years 10 months ago
1993
ACM
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...