Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems (Q3132888): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| label / en | label / en | ||
Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems | |||
| Property / arXiv classification | |||
cs.CG | |||
| Property / arXiv classification: cs.CG / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
cs.DM | |||
| Property / arXiv classification: cs.DM / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
cs.DS | |||
| Property / arXiv classification: cs.DS / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
math.CO | |||
| Property / arXiv classification: math.CO / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2962942414 / rank | |||
Normal rank | |||
| Property / title | |||
Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems (English) | |||
| Property / title: Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems (English) / rank | |||
Normal rank | |||
Latest revision as of 10:04, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
