Fast enumeration algorithms for non-crossing geometric graphs (Q5896957): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S00454-009-9164-4 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00454-009-9164-4 / rank | |||
Normal rank | |||
Latest revision as of 04:36, 10 December 2024
scientific article; zbMATH DE number 5598793
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast enumeration algorithms for non-crossing geometric graphs |
scientific article; zbMATH DE number 5598793 |
Statements
Fast enumeration algorithms for non-crossing geometric graphs (English)
0 references
27 August 2009
0 references
enumeration
0 references
non-crossing geometric graphs
0 references
triangulations
0 references
0 references
0 references
0 references
