3471 search results - page 244 / 695 » Obstacle Numbers of Graphs |
176
click to vote
AAIM
2005
Springer
16 years 5 days ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
135
click to vote
FCT
2005
Springer
16 years 4 days ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
172
click to vote
GD
2004
Springer
16 years 12 hour 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...