Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm.
Paulden, Tim, Smith, David K. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On the locality of the Prüfer code.”
Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm.
Characterization of -bar visibility trees.
Chen, Guantao, Hutchinson, Joan P., Keating, Ken, Shen, Jian (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Asymptotics for rooted bipartite planar maps and scaling limits of two-type spatial trees.
Weill, Mathilde (2007)
Electronic Journal of Probability [electronic only]
Similarity:
On computing the distinguishing numbers of trees and forests.
Cheng, Christine T. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lower bounds on van der Waerden numbers: randomized- and deterministic-constructive.
Gasarch, William, Haeupler, Bernhard (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Random procedures for dominating sets in graphs.
Artmann, Sarah, Göring, Frank, Harant, Jochen, Rautenbach, Dieter, Schiermeyer, Ingo (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The largest component in an inhomogeneous random intersection graph with clustering.
Bloznelis, Mindaugas (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Spanning trees of bounded degree.
Czygrinow, Andrzej, Fan, Genghua, Hurlbert, Glenn, Kierstead, H.A., Trotter, William T. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The best bounds in a theorem of Russell Lyons.
Marchal, Philippe (1998)
Electronic Communications in Probability [electronic only]
Similarity:
Generalized Cauchy identities, trees and multidimensional Brownian motions. I: Bijective proof of generalized Cauchy identities.
Śniady, Piotr (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A distributed voting scheme to maximize preferences
Peter Auer, Nicolò Cesa-Bianchi (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
We study the problem of designing a distributed voting scheme for electing a candidate that maximizes the preferences of a set of agents. We assume the preference of agent for candidate is a real number , and we do not make any assumptions on the mechanism generating these preferences. We show simple randomized voting schemes guaranteeing the election of a candidate whose expected total preference is nearly the highest among all candidates. The algorithms we consider are designed...
Linear speed large deviations for percolation clusters.
Kovchegov, Yevgeniy, Sheffield, Scott (2003)
Electronic Communications in Probability [electronic only]
Similarity: