Exploració per tema "analytic combinatorics"

Ara es mostren els items 1-9 de 9

    • Analytic combinatorics of chord and hyperchord diagrams with k crossings 

      Pilaud, Vincent; Rué Perna, Juan José (2014-05-07)
      Article
      Accés obert
      Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, chord diagrams, and hyperchord diagrams on a disk with a prescribed number of crossings. For each family, we express the ...

    • Dynamic programming for graphs on surfaces 

      Rué Perna, Juan José; Sau, Ignasi; Thilikos, Dimitrios (Springer, 2010)
      Text en actes de congrés
      Accés obert
      We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where ...

    • Graph classes with given 3-connected components: asymptotic counting, limit laws and critical phenomena 

      Giménez Llach, Omer; Noy Serrano, Marcos; Rué Perna, Juan José (Edicions de la Universitat de Lleida (UdL), 2008)
      Comunicació de congrés
      Accés restringit per política de l'editorial
      Consider a family T of 3-connected graphs, and let G be the class of graphs whose 3-connected components are graphs in T . We present a general framework for analyzing such graphs classes based on singularity analysis of ...

    • Many 2-level polytopes from matroids 

      Grande, Francesco; Rué Perna, Juan José (2015-10-26)
      Article
      Accés obert
      The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-Level matroids generalize series-parallel graphs, which ...

    • On the limiting distribution of the metric dimension for random forests 

      Rué Perna, Juan José; Mitsche, Dieter (2015-03-20)
      Article
      Accés obert
      The metric dimension of a graph G is the minimum size of a subset S of vertices of G such that all other vertices are uniquely determined by their distances to the vertices in S. In this paper we investigate the metric ...

    • Random cubic planar graphs revisited 

      Rué Perna, Juan José; Noy Serrano, Marcos; Requile, Clement (Elsevier, 2016)
      Altres
      Accés restringit per política de l'editorial
      The goal of our work is to analyze random cubic planar graphs according to the uniform distribution. More precisely, let G be the class of labelled cubic planar graphs and let gn be the number of graphs with n vertices. ...

    • Random cubic planar maps 

      Drmota, Michael; Noy Serrano, Marcos; Requile, Clement; Rué Perna, Juan José (2023-06-30)
      Article
      Accés obert
      We analyse uniform random cubic rooted planar maps and obtain limiting distributions for several parameters of interest. From the enumerative point of view, we present a unified approach for the enumeration of several ...

    • Subgraph statistics in subcritical graph classes 

      Drmota, Michael; Ramos Garrido, Lander; Rué Perna, Juan José (2017-04-01)
      Article
      Accés obert
      Let H be a fixed graph and math formula a subcritical graph class. In this paper we show that the number of occurrences of H (as a subgraph) in a graph in math formula of order n, chosen uniformly at random, follows a ...

    • Triangles in random cubic planar graphs 

      Requilé, Clément; Rué Perna, Juan José (2015)
      Comunicació de congrés
      Accés restringit per política de l'editorial
      In this extended abstract we determine a normal limiting distribution for the number of triangles in a uniformly at random 3-connected cubic planar graph, as well as the precise expectation and variance values. Further ...