A practical algorithm for making filled graphs minimal (Q1589427)
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: A practical algorithm for making filled graphs minimal |
scientific article; zbMATH DE number 1542261
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A practical algorithm for making filled graphs minimal |
scientific article; zbMATH DE number 1542261 |
Statements
A practical algorithm for making filled graphs minimal (English)
0 references
12 December 2000
0 references
filled graph
0 references
