228 search results - page 2 / 46 » Local Computations in Graphs: The Case of Cellular Edge Loca... |
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
SIROCCO
2007
13 years 6 months ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
SIAMJO
2010
13 years 3 days ago
2010
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
JEI
2007
13 years 5 months ago
2007
This paper presents an efficient technique for linking edge points in order to generate a closed-contour representation. It is based on the consecutive use of global and local sch...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract—Intuitively, identification of nodes close to the network edge is key to the successful setup, and continued operation, of many sensor network protocols and application...