Computing the bounded subcomplex of an unbounded polyhedron (Q1941218): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:57, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the bounded subcomplex of an unbounded polyhedron |
scientific article |
Statements
Computing the bounded subcomplex of an unbounded polyhedron (English)
0 references
12 March 2013
0 references
unbounded polyhedron
0 references
bounded subcomplex
0 references
Hasse diagram
0 references
vertex-incidences
0 references
tight span
0 references
numerical examples
0 references
combinatorial algorithms
0 references
