Sciweavers

1949 search results - page 56 / 390
» Random graphs on surfaces
Sort
View
RSA
2006
110views more  RSA 2006»
14 years 11 months ago
The degree sequences and spectra of scale-free random graphs
We investigate the degree sequences of scale-free random graphs. We obtain a formula for the limiting proportion of vertices with degree d, confirming non-rigorous arguments of Do...
Jonathan Jordan
PODS
2006
ACM
127views Database» more  PODS 2006»
16 years 1 hour ago
Evolution of page popularity under random web graph models
The link structure of the Web can be viewed as a massive graph. The preferential attachment model and its variants are well-known random graph models that help explain the evoluti...
Rajeev Motwani, Ying Xu 0002
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 1 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
COMBINATORICA
2010
14 years 9 months ago
Online vertex-coloring games in random graphs
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
Martin Marciniszyn, Reto Spöhel
CN
2010
121views more  CN 2010»
14 years 8 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...