Graph / Vertex (Bibtex)

P482: Enumeration of all extreme points of a convex polytope

Input:

$m$ inequalities with $n$ dimension.

Output:

All extreme points of the convex polytope defined by the inequalities.

Complexity:

Comment:

Extreme points = vertex

Reference:

[Dyer1977] (Bibtex)