An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex (Q1312773)
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: An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex |
scientific article; zbMATH DE number 495356
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex |
scientific article; zbMATH DE number 495356 |
Statements
An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex (English)
0 references
5 May 1994
0 references
convex polyhedra
0 references
degeneracy graphs
0 references
neighborhood-problem
0 references
subgraph
0 references
lexicographic pivot selection strategy
0 references
0 references
0 references
