Efficient algorithms for listing unlabeled graphs (Q3990619)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for listing unlabeled graphs |
scientific article; zbMATH DE number 38396
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for listing unlabeled graphs |
scientific article; zbMATH DE number 38396 |
Statements
Efficient algorithms for listing unlabeled graphs (English)
0 references
28 June 1992
0 references
graph generation
0 references
polynomial delay
0 references
