Fast enumeration algorithms for non-crossing geometric graphs (Q5896957): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00454-009-9164-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4233537290 / rank | |||
Normal rank | |||
Revision as of 01:43, 20 March 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
