Uniform random sampling of planar graphs in linear time (Q3055787): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The number of labeled 2-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic enumeration of rooted convex polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating labeled planar graphs uniformly at random / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs, via well-orderly maps and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar maps as labeled mobiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform random generation of decomposable structures using floating-point arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2959860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boltzmann Samplers for the Random Generation of Combinatorial Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singularity Analysis of Generating Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus for the random generation of labelled combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversal structures on triangulations: A combinatorial study and straight-line drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Continuous Time Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The enumeration of c-nets via quadrangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2959885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bijection for triangulations of a polygon with interior points and multiple edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal coding and sampling of triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Census of Planar Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting labelled three-connected and homeomorphically irreducible two- connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Isomorphic Graphs / rank
 
Normal rank

Latest revision as of 11:34, 3 July 2024

scientific article
Language Label Description Also known as
English
Uniform random sampling of planar graphs in linear time
scientific article

    Statements

    Uniform random sampling of planar graphs in linear time (English)
    0 references
    0 references
    0 references
    9 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    planar graphs
    0 references
    random generation
    0 references
    Boltzmann sampling
    0 references
    0 references
    0 references