Sciweavers

202 search results - page 20 / 41
» Large-Girth Roots of Graphs
Sort
View
CPC
2006
110views more  CPC 2006»
13 years 7 months ago
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
József Balogh, Yuval Peres, Gábor Pe...
JCT
2010
112views more  JCT 2010»
13 years 5 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra
MIDDLEWARE
2010
Springer
13 years 5 months ago
dFault: Fault Localization in Large-Scale Peer-to-Peer Systems
Distributed hash tables (DHTs) have been adopted as a building block for large-scale distributed systems. The upshot of this success is that their robust operation is even more imp...
Pawan Prakash, Ramana Rao Kompella, Venugopalan Ra...
TOMS
2010
106views more  TOMS 2010»
13 years 5 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 7 months ago
Schnyder decompositions for regular plane graphs and application to drawing
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
Olivier Bernardi, Éric Fusy