On-line and off-line vertex enumeration by adjacency lists (Q1180822)
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: On-line and off-line vertex enumeration by adjacency lists |
scientific article; zbMATH DE number 30026
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line and off-line vertex enumeration by adjacency lists |
scientific article; zbMATH DE number 30026 |
Statements
On-line and off-line vertex enumeration by adjacency lists (English)
0 references
27 June 1992
0 references
For off- and on-line enumeration of the vertices of polytopes a method based on adjacency lists of the vertices is proposed and compared to other known methods. In addition to theoretical complexity bounds, computational comparison with the algorithm of \textit{M. E. Dyer} [Math. Oper. Res. 8, 381-402 (1983; Zbl 0531.90064)] on test problems from the literature is provided.
0 references
vertices of polytopes
0 references
adjacency lists
0 references
theoretical complexity bounds
0 references
0 references
0 references
