Results 281 to 290 of about 166,958 (306)

Random spanning tree

Journal of Algorithms, 1983
Abstract Dans cet article, nous proposons un algorithme de complexite polynomiale pour construire un arbre au hasard qui soit un graphe partiel d'un graphe donne. Il consiste essentielleement a construire une arborescence de rang donne sur ce graphe, l'ensemble des arborescences etant ordonne par rapport aux valeurs croissantes de la racine et a ...
openaire   +1 more source

Random leaders and random spanning trees

1989
The problem of distributively constructing a minimum spanning tree has been thoroughly studied. The root of this spanning tree is often elected as a leader, and then centralized algorithms are run in the distributed system. If, however, we have fault tolerance in mind, selecting a random spanning tree and a random leader are more desirable.
Judit Bar-Ilan, Dror Zernik
openaire   +1 more source

Random Sequential Adsorption on Random Trees

Journal of Statistical Physics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

The Height and Size of Random Hash Trees and Random Pebbled Hash Trees

SIAM Journal on Computing, 1999
Summary: The random hash tree and the \(N\)-tree were introduced by Ehrlich in 1981. In the random hash tree, \(n\) data points are hashed to values \(X_1, \dots, X_n\), independently and identically distributed random variables taking values that are uniformly distributed on \([0,1]\).
openaire   +2 more sources

Random walks on trees

2005
Random walks or Brownian motions appear as a useful tool in algorithm analysis. Recently P. Flajolet ([2]) obtained a complete and detailed analysis of the two stacks problem with the help of properties of simple random walks on lattices. G. Louchard ([7], [8]) proved that the Brownian motion permits to give easily asymptotic results on the complexity ...
openaire   +1 more source

Random Trees and Tree Codes

1972
A random tree is a probabilistic system much like a random walk. In a random walk, a particle moves up or down as time progresses in accordance with some stochastic law. A random tree, on the other hand, starts with one particle at time zero, this particle branches into a number of particles, each of which move up or down in accordance with a ...
openaire   +1 more source

A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees

Discrete Applied Mathematics, 2021
, Cecilia Holmgren, Dieter Mitsche
exaly  

Universal height and width bounds for random trees

Electronic Journal of Probability, 2022
Louigi Addario-Berry
exaly  

Simply generated trees, conditioned Galton–Watson trees, random allocations and condensation

Probability Surveys, 2012
Svante Janson
exaly  

The Wiener Index of Random Digital Trees

SIAM Journal on Discrete Mathematics, 2015

exaly