505 search results - page 66 / 101 » On A Graph Formalism for Ordered Edges |
IM
2008
14 years 9 months ago
2008
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
IM
2007
14 years 9 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
INFOCOM
2002
IEEE
15 years 2 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...
135
Voted
ALGORITHMICA
2011
14 years 4 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...