Fast enumeration algorithms for non-crossing geometric graphs (Q5901415)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5507887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
