3008 search results - page 116 / 602 » Independence in connected graphs |
179
click to vote
PERCOM
2004
ACM
16 years 6 months ago
2004
ACM
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
154
click to vote
ICCSA
2004
Springer
15 years 11 months ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
182
click to vote
DIAU
2000
Springer
15 years 10 months ago
2000
Springer
This paper presents a security analysis of Onion Routing, an application independent infrastructure for tra c-analysis-resistant and anonymous Internet connections. It also includ...
165
click to vote
COMPGEOM
2006
ACM
16 years 11 days ago
2006
ACM
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
180
click to vote
TCS
2008
15 years 6 months ago
2008
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...