Counting triangulations and other crossing-free structures via onion layers (Q2351010): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q489339
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Victor Alvarez / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982545413 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1312.4628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better upper bound on the number of triangulations of a planar point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the number of triangulations of planar point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gray code enumeration of plane straight-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of plane geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing-Free Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple aggregative algorithm for counting triangulations of planar point sets and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting crossing-free structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting triangulations and other crossing-free structures via onion layers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting triangulations and other crossing-free structures approximately / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time instances of the minimum weight triangulation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for enumeration of triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the onion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating random polygons with given vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Maximum Multiplicity of Some Common Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic combinatorics of non-crossing configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of crossing-free subgraphs of \(K_N\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulations and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Plane Graphs: Flippability and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5419979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast enumeration algorithms for non-crossing geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Plane Graphs with Exponential Speed-Up / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Crossing‐Free Matchings, Cycles, and Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting triangulations of planar point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees in random triangulations of point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting and Enumerating Crossing-free Geometric Graphs / rank
 
Normal rank

Latest revision as of 08:57, 10 July 2024

scientific article
Language Label Description Also known as
English
Counting triangulations and other crossing-free structures via onion layers
scientific article

    Statements

    Counting triangulations and other crossing-free structures via onion layers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2015
    0 references
    triangulations
    0 references
    crossing-free structures
    0 references
    algorithmic geometry
    0 references
    counting algorithms
    0 references
    matchings
    0 references
    spanning cycles
    0 references
    spanning trees
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references