Zobrazeno 1 - 10
of 144
pro vyhledávání: '"Fusy, Eric"'
Publikováno v:
35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 302, pp. 6:1-6:14
We introduce a model of tree-rooted planar maps weighted by their number of $2$-connected blocks. We study its enumerative properties and prove that it undergoes a phase transition. We give the distribution of the size of the largest $2$-connected bl
Externí odkaz:
http://arxiv.org/abs/2407.16809
We present two graph drawing algorithms based on the recently defined "grand-Schnyder woods", which are a far-reaching generalization of the classical Schnyder woods. The first is a straight-line drawing algorithm for plane graphs with faces of degre
Externí odkaz:
http://arxiv.org/abs/2403.18980
A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a rich structure, with links to lattice congruences, flip graphs, polytopes
Externí odkaz:
http://arxiv.org/abs/2402.01483
We introduce a simple bijection between Tamari intervals and the blossoming trees (Poulalhon and Schaeffer, 2006) encoding planar triangulations, using a new meandering representation of such trees. Its specializations to the families of synchronized
Externí odkaz:
http://arxiv.org/abs/2312.13159
We define some Schnyder-type combinatorial structures on a class of planar triangulations of the pentagon which are closely related to 5-connected triangulations. The combinatorial structures have three incarnations defined in terms of orientations,
Externí odkaz:
http://arxiv.org/abs/2305.19058
We define a far-reaching generalization of Schnyder woods which encompasses many classical combinatorial structures on planar graphs. Schnyder woods are defined for planar triangulations as certain triples of spanning trees covering the triangulation
Externí odkaz:
http://arxiv.org/abs/2303.15630
Autor:
Fusy, Éric, Kucherov, Gregory
Conservative Count-Min, an improved version of Count-Min sketch [Cormode, Muthukrishnan 2005], is an online-maintained hashing-based data structure summarizing element frequency information without storing elements themselves. Although several works
Externí odkaz:
http://arxiv.org/abs/2302.05245
Publikováno v:
Electron. J. Probab. 28, 1-54, (2023)
In this paper, the scaling limit of random connected cubic planar graphs (respectively multigraphs) is shown to be the Brownian sphere. The proof consists in essentially two main steps. First, thanks to the known decomposition of cubic planar graphs
Externí odkaz:
http://arxiv.org/abs/2203.17245
Autor:
Fusy, Éric, Kucherov, Gregory
Count-Min sketch is a hash-based data structure to represent a dynamically changing associative array of counters. Here we analyse the counting version of Count-Min under a stronger update rule known as \textit{conservative update}, assuming the unif
Externí odkaz:
http://arxiv.org/abs/2203.15496
Publikováno v:
Electronic Journal of Combinatorics, Volume 30, Issue 2, P2.17 (2023)
We show that corner polyhedra and 3-connected Schnyder labelings join the growing list of planar structures that can be set in exact correspondence with (weighted) models of quadrant walks via a bijection due to Kenyon, Miller, Sheffield and Wilson.
Externí odkaz:
http://arxiv.org/abs/2202.09172