1447 search results - page 209 / 290 » Graphs and Path Equilibria |
171
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
160
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
174
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
178
click to vote
SPAA
1990
ACM
15 years 10 months ago
1990
ACM
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
198
click to vote
PODC
2006
ACM
16 years 10 days ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...