Peeling and nibbling the cactus: subexponential-time algorithms for counting triangulations and related problems (Q3132888)
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: Peeling and nibbling the cactus: subexponential-time algorithms for counting triangulations and related problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Peeling and nibbling the cactus: subexponential-time algorithms for counting triangulations and related problems |
scientific article |
Statements
30 January 2018
0 references
computational geometry
0 references
triangulations
0 references
exponential-time algorithms
0 references
cs.CG
0 references
cs.DM
0 references
cs.DS
0 references
math.CO
0 references
Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems (English)
0 references
0.8565208315849304
0 references
0.8497575521469116
0 references
0.8313339948654175
0 references
0.8201561570167542
0 references
0.8195102214813232
0 references
