5606 search results - page 59 / 1122 » Randomization Techniques for Graphs. |
136
Voted
CORR
2008
Springer
15 years 20 days 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...
138
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...
105
click to vote
WEA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
141
Voted
COMBINATORICA
2010
14 years 10 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
113
click to vote
COMBINATORICS
2006
15 years 1 months ago
2006
A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to...