Fast enumeration algorithms for non-crossing geometric graphs (Q5901415)
From MaRDI portal
scientific article; zbMATH DE number 5507887
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast enumeration algorithms for non-crossing geometric graphs |
scientific article; zbMATH DE number 5507887 |
Statements
Fast enumeration algorithms for non-crossing geometric graphs (English)
0 references
12 February 2009
0 references
