Live briefing
Everything about Vertex enumeration problem
In mathematics, the vertex enumeration problem for a polytope, a polyhedral cell complex, a hyperplane arrangement, or some other object of discrete geometry, is the problem of determination of the object's vertices given some formal representation of the object. A classical example is the problem of enumeration of the vertices of a convex polytope specified by a set of linear inequalities: Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Vertex enumeration problemA 5-minute orientation
- Pick up a classic book: Groups, algebras and applicationsThe most-reprinted book on the subject
- Read the landmark paper: On the Minimum Feedback Vertex Set Problem: Exact and Enumeration AlgorithmsCited 87 times
- Go sideways: Reverse-search algorithmA closely related topic
- Go sideways: Convex polytopeA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
- 📕Groups, algebras and applicationsLatin American Algebra Colloquium (18th 2009 São Pedro, São Paulo, Brazil) · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Reverse-search algorithm Reverse-search algorithms are a class of algorithms for generating all objects of a given size, from certain classes of combinatorial objects. In many…
- Convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean…
- Criss-cross algorithm In mathematical optimization, the criss-cross algorithm is any of a family of algorithms for linear programming. Variants of the criss-cross algorithm…
- David Avis David Michael Avis (born March 20, 1951) is a Canadian and British computer scientist known for his contributions to geometric computations. Avis is a…
- Komei Fukuda Komei Fukuda (Japanese: 福田 公明, 1951 - July 27, 2026) was a Japanese mathematician known for his contributions to optimization, polyhedral computation and…
- Polyhedron In geometry, a polyhedron (pl.: polyhedra or polyhedrons; from Greek πολύ (poly-) 'many' and ἕδρον (-hedron) 'base, seat') is a three-dimensional figure…
- Integral polytope In geometry and polyhedral combinatorics, an integral polytope is a convex polytope whose vertices all have integer Cartesian coordinates. That is, it…
- Polymake polymake is a software for the algorithmic treatment of convex polyhedra. Albeit primarily a tool to study the combinatorics and the geometry of convex…