4865 search results - page 552 / 973 » The Complexity of Graph Connectivity |
194
click to vote
LION
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
203
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
174
click to vote
WEA
2007
Springer
16 years 1 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
164
click to vote
HICSS
2005
IEEE
16 years 15 days ago
2005
IEEE
Bluetooth is a universal radio interface for short-range wireless networks. The basic Bluetooth network topology is a single-hop star-shaped piconet. Several such piconets can be ...
157
click to vote
ICRA
2005
IEEE
16 years 14 days ago
2005
IEEE
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...