Sciweavers

3008 search results - page 424 / 602
» Independence in connected graphs
Sort
View
STACS
2007
Springer
16 years 1 months ago
Light Orthogonal Networks with Constant Geometric Dilation
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 ...
Adrian Dumitrescu, Csaba D. Tóth
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
16 years 1 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
HICSS
2005
IEEE
204views Biometrics» more  HICSS 2005»
16 years 17 days ago
A Dynamic and Distributed Scatternet Formation Protocol for Real-life Bluetooth Scatternets
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 ...
Deepak Jayanna, Gergely V. Záruba
ICRA
2005
IEEE
135views Robotics» more  ICRA 2005»
16 years 17 days ago
Efficient Closed Contour Extraction from Range Image's Edge Points
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. ...
Angel Domingo Sappa
COMPLIFE
2005
Springer
16 years 15 days ago
The Architecture of a Proteomic Network in the Yeast
Abstract. We describe an approach to clustering the yeast protein-protein interaction network in order to identify functional modules, groups of proteins forming multi-protein comp...
Emad Ramadan, Christopher Osgood, Alex Pothen