1199 search results - page 182 / 240 » Graph Theory |
102
click to vote
WWW
2007
ACM
16 years 16 days ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
102
click to vote
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
132
click to vote
PODC
2006
ACM
15 years 5 months 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...
205
click to vote
GIS
2005
ACM
16 years 27 days ago
2005
ACM
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...
149
click to vote
STOC
2007
ACM
16 years 5 days ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...