330 search results - page 40 / 66 » Compressing Bounded Degree Graphs |
152
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
137
Voted
SIAMDM
2010
15 years 1 months ago
2010
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...
141
click to vote
ICDCS
2002
IEEE
15 years 7 months ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
130
click to vote
JCO
2011
14 years 9 months ago
2011
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
131
Voted
CRYPTO
2007
Springer
15 years 8 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}...