Extremals of the supereigenvector cone in max algebra: a combinatorial description

Abstract

We give a combinatorial description of extremal generators of the supereigenvector cone {x: Ax>=x} in max algebra.

11 pages

References in corpus (2)

• The Minkowski Theorem for Max-plus Convex Sets
• Computing the vertices of tropical polyhedra using directed hypergraphs