Counting and enumerating crossing-free geometric graphs (Q4635522)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting and enumerating crossing-free geometric graphs |
scientific article; zbMATH DE number 6862989
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting and enumerating crossing-free geometric graphs |
scientific article; zbMATH DE number 6862989 |
Statements
Counting and Enumerating Crossing-free Geometric Graphs (English)
0 references
23 April 2018
0 references
convex partitions
0 references
convex subdivisions
0 references
counting
0 references
crossing-free geometric graphs
0 references
enumerating
0 references
perfect matchings
0 references
spanning cycles
0 references
spanning trees
0 references
triangulations
0 references
0.9931628704071044
0 references
0.8820799589157104
0 references
0.8632206320762634
0 references
0.8479286432266235
0 references
0.8273465633392334
0 references
