Skip to Main content Skip to Navigation
Journal articles

Computing the Vertices of Tropical Polyhedra using Directed Hypergraphs

Abstract : We establish a characterization of the vertices of a tropical polyhedron defined as the intersection of finitely many half-spaces. We show that a point is a vertex if, and only if, a directed hypergraph, constructed from the subdifferentials of the active constraints at this point, admits a unique strongly connected component that is maximal with respect to the reachability relation (all the other strongly connected components have access to it). This property can be checked in almost linear-time. This allows us to develop a tropical analogue of the classical double description method, which computes a minimal internal representation (in terms of vertices) of a polyhedron defined externally (by half-spaces or hyperplanes). We provide theoretical worst case complexity bounds and report extensive experimental tests performed using the library TPLib, showing that this method outperforms the other existing approaches.
Document type :
Journal articles
Complete list of metadata
Contributor : Canimogy Cogoulane Connect in order to contact the contributor
Submitted on : Wednesday, January 30, 2013 - 5:06:54 PM
Last modification on : Friday, February 18, 2022 - 3:09:08 AM

Links full text




Xavier Allamigeon, Stéphane Gaubert, Eric Goubault. Computing the Vertices of Tropical Polyhedra using Directed Hypergraphs. Discrete and Computational Geometry, Springer Verlag, 2013, 49, pp.247-279. ⟨10.1007/s00454-012-9469-6⟩. ⟨hal-00782862⟩



Record views