641 search results - page 122 / 129 » On Planar Quasi-Parity Graphs |
OPODIS
2004
13 years 9 months ago
2004
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost impos...
DCOSS
2006
Springer
13 years 11 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
AI
2007
Springer
13 years 8 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
ISAAC
1999
Springer
14 years 2 days ago
1999
Springer
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...