736 search results - page 12 / 148 » Distinguishing geometric graphs |
SODA
1994
ACM
15 years 1 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
109
click to vote
ENDM
2008
14 years 11 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
126
click to vote
ECCC
2007
14 years 11 months ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
ALGORITHMICA
2000
14 years 11 months ago
2000
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...