Sciweavers

2853 search results - page 434 / 571
» Finding related tables
Sort
View
DC
2010
13 years 8 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
DM
2010
90views more  DM 2010»
13 years 8 months ago
Knights, spies, games and ballot sequences
This paper solves the Knights and Spies Problem: In a room there are n people, each labelled with a unique number between 1 and n. A person may either be a knight or a spy. Knights...
Mark Wildon
ENDM
2008
142views more  ENDM 2008»
13 years 8 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
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) ...
Ignaz Rutter, Alexander Wolff
BIB
2006
141views more  BIB 2006»
13 years 8 months ago
Statistical significance in biological sequence analysis
One of the major goals of computational sequence analysis is to find sequence similarities, which could serve as evidence of structural and functional conservation, as well as of ...
Alexander Yu. Mitrophanov, Mark Borodovsky
GIS
2008
ACM
13 years 8 months ago
Geographical analysis of hierarchical business structures by interactive drill down
This paper deals with the geographical analysis and visualization of network marketing. The aim of the study was to develop interactive visual methods, which help to answer questi...
Klaus Böhm, Eva Daub