Results 1 
9 of
9
Optimal Coding and Sampling of Triangulations
, 2003
"... Abstract. We present a simple encoding of plane triangulations (aka. maximal planar graphs) by plane trees with two leaves per inner node. Our encoding is a bijection taking advantage of the minimal Schnyder tree decomposition of a plane triangulation. Coding and decoding take linear time. As a bypr ..."
Abstract

Cited by 39 (5 self)
 Add to MetaCart
Abstract. We present a simple encoding of plane triangulations (aka. maximal planar graphs) by plane trees with two leaves per inner node. Our encoding is a bijection taking advantage of the minimal Schnyder tree decomposition of a plane triangulation. Coding and decoding take linear time. As a byproduct we derive: (i) a simple interpretation of the formula for the number of plane triangulations with n vertices, (ii) a linear random sampling algorithm, (iii) an explicit and simple information theory optimal encoding. 1
Uniform random sampling of planar graphs in linear time
, 2007
"... Abstract. This article introduces new algorithms for the uniform random generation of labelled planar graphs. Its principles rely on Boltzmann samplers, as recently developed by Duchon, Flajolet, Louchard, and Schaeffer. It combines the Boltzmann framework, a suitable use of rejection, a new combina ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Abstract. This article introduces new algorithms for the uniform random generation of labelled planar graphs. Its principles rely on Boltzmann samplers, as recently developed by Duchon, Flajolet, Louchard, and Schaeffer. It combines the Boltzmann framework, a suitable use of rejection, a new combinatorial bijection found by Fusy, Poulalhon and Schaeffer, as well as a precise analytic description of the generating functions counting planar graphs, which was recently obtained by Giménez and Noy. This gives rise to an extremely efficient algorithm for the random generation of planar graphs. There is a preprocessing step of some fixed small cost; and the expected time complexity of generation is quadratic for exactsize uniform sampling and linear for approximatesize sampling. This greatly improves on the best previously known time complexity for exactsize uniform sampling of planar graphs with n vertices, which was a little over O(n 7). This is the extended and revised journal version of a conference paper with the title “Quadratic exactsize and linear approximatesize random generation of planar graphs”, which appeared in the Proceedings of the International Conference on Analysis of Algorithms (AofA’05), 610 June 2005, Barcelona. 1.
Enumerative formulae for unrooted planar maps: a pattern
 ELECTRON J. COMBIN
, 2004
"... We present uniformly available simple enumerative formulae for unrooted planar nedge maps (counted up to orientationpreserving isomorphism) of numerous classes including arbitrary, loopless, nonseparable, eulerian maps and plane trees. All the formulae conform to a certain pattern with respect t ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We present uniformly available simple enumerative formulae for unrooted planar nedge maps (counted up to orientationpreserving isomorphism) of numerous classes including arbitrary, loopless, nonseparable, eulerian maps and plane trees. All the formulae conform to a certain pattern with respect to the terms of the sum over t j n; t! n: Namely, these terms, which correspond to nontrivial automorphisms of the maps, prove to be of the form OE \Gamma
UNIFIED BIJECTIONS FOR MAPS WITH PRESCRIBED DEGREES AND GIRTH
"... Abstract. Thisarticlepresents unifiedbijective constructions forplanarmaps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least d = 1,2,3 are respectively the general, loopless, and simple maps. For each positiv ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. Thisarticlepresents unifiedbijective constructions forplanarmaps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least d = 1,2,3 are respectively the general, loopless, and simple maps. For each positive integer d, we obtain a bijection for the class of plane maps (maps with one distinguished rootface) of girth d having a rootface of degree d. We then obtain more general bijective constructions for annular maps (maps with two distinguished rootfaces) of girth at least d. Our bijections associate to each map a decorated plane tree, and nonroot faces of degree k of the map correspond to vertices of degree k of the tree. As special cases we recover several known bijections for bipartite maps, loopless triangulations, simple triangulations, simple quadrangulations, etc. Our work unifies and greatly extends these bijective constructions. In terms of counting, we obtain for each integer d an expression for the generating function Fd(xd,xd+1,xd+2,...) of plane maps of girth d with rootface of degree d, where the variable xk counts the nonroot faces of degree k. The expression for F1 was already obtained bijectively by Bouttier, Di Francesco and Guitter, but for d ≥ 2 the expression of Fd is new. We also obtain an expression for the generating function G (d,e) p,q (xd,xd+1,...) of annular maps with rootfaces of degrees p and q, such that cycles separating the two rootfaces have length at least e while other cycles have length at least d. Our strategy is to obtain all the bijections as specializations of a single “master bijection ” introduced by the authors in a previous article. In order to use this approach, we exhibit certain “canonical orientations ” characterizing maps with prescribed girth constraints. 1.
A unified bijective method for maps: application to two classes with boundaries
"... boundaries ..."
A LINEAR APPROXIMATESIZE RANDOM SAMPLER FOR LABELLED PLANAR GRAPHS
, 2007
"... This article introduces a new algorithm for the random generation of labelled planar graphs. Its principles rely on Boltzmann samplers, as recently developed by Duchon, Flajolet, Louchard, and Schaeffer. It combines the Boltzmann framework, a suitable use of rejection, a new combinatorial bijection ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This article introduces a new algorithm for the random generation of labelled planar graphs. Its principles rely on Boltzmann samplers, as recently developed by Duchon, Flajolet, Louchard, and Schaeffer. It combines the Boltzmann framework, a suitable use of rejection, a new combinatorial bijection found by Fusy, Poulalhon and Schaeffer, as well as a precise analytic description of the generating functions counting planar graphs, which was recently obtained by Giménez and Noy. This gives rise to an extremely efficient algorithm for the random generation of planar graphs. There is a preprocessing step of some fixed small cost. Then, the expected time complexity of generation is quadratic for exactsize uniform sampling and linear for approximatesize sampling. This greatly improves on the best previously known time complexity for exactsize uniform sampling of planar graphs with n vertices, which was a little over O(n 7).
ON TRIANGULATIONS WITH HIGH VERTEX DEGREE
, 2006
"... Abstract. We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of nonseparable triangulations in which all vertices have degree at least d, for a certain value d chosen in {3, 4, 5}. The originality of t ..."
Abstract
 Add to MetaCart
Abstract. We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of nonseparable triangulations in which all vertices have degree at least d, for a certain value d chosen in {3, 4, 5}. The originality of the problem lies in the fact that degree restrictions are placed both on vertices and faces. Our proofs first follow Tutte’s classical approach: we decompose maps by deleting the root and translate the decomposition into an equation satisfied by the generating function of the maps under consideration. Then we proceed to solve the equation obtained using a recent technique that extends the socalled quadratic method. 1.
Bijective counting of maps by girth and degrees I: restricted boundary conditions
"... Abstract. For each positive integer d, we present a bijection between the set of planar maps of girth d inside a dgon and a set of decorated plane trees. The bijection has the property that each face of degree k in the map corresponds to a vertex of degree k in the tree, so that maps of girth d can ..."
Abstract
 Add to MetaCart
Abstract. For each positive integer d, we present a bijection between the set of planar maps of girth d inside a dgon and a set of decorated plane trees. The bijection has the property that each face of degree k in the map corresponds to a vertex of degree k in the tree, so that maps of girth d can be counted according to the degree distribution of their faces. More precisely, we obtain for each integer d an explicit expression for the multivariate series Fd(xd,xd+1,xd+2,...) counting rooted maps of girth d inside a dgon, where each variable xk marks the number of inner faces of degree k. The series F1 (corresponding to maps inside a loop) was already computed bijectively by Bouttier, Di Francesco and Guitter, but for d ≥ 2 the expression of Fd is new. As special cases, we recover several known bijections (bipartite maps, loopless triangulations, simple triangulations, simple quadrangulations, etc.). Our strategy is based on the use of a “master bijection”, introduced by the authors inaprevious paper, between aclass oforiented planar mapsand a class of decorated trees. We obtain our bijections for maps of girth d by specializing the master bijection. Indeed, by defining some “canonical orientations ” for maps of girth d, it is possible to identify the class of maps of girth d inside a dgon with a class of oriented maps on which the master bijection specializes nicely. The same strategy was already used in a previous article in order to count dangulations of girth d, and what we present here is a very significant extension of those results. 1.
Hubert de FRAYSSEIX..................
, 2010
"... pour obtenir le grade de Docteur de l ’ École Polytechnique ..."