5889 search results - page 415 / 1178 » Graph Layout Problems |
222
Voted
SPIRE
2005
Springer
16 years 10 days ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
175
click to vote
ICALP
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
167
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...
203
click to vote
IJSNET
2007
15 years 6 months ago
2007
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
205
click to vote
TCSV
2008
15 years 6 months ago
2008
Object tracking is one of the fundamental problems in computer vision and has received considerable attention in the past two decades. The success of a tracking algorithm relies on...