Fast enumeration algorithms for non-crossing geometric graphs (Q5896957): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:50, 30 January 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
