Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron

This publication has 10 references indexed in Scilit:

• Reverse search for enumeration
  Discrete Applied Mathematics, 1996
• Segments in enumerating faces
  Mathematical Programming, 1995
• Finding all the perfect matchings in bipartite graphs
  Applied Mathematics Letters, 1994
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
  Discrete & Computational Geometry, 1992
• Finding all minimum‐cost perfect matchings in Bipartite graphs
  Networks, 1992
• The Complexity of Vertex Enumeration Methods
  Mathematics of Operations Research, 1983
• Some NP-complete problems in linear programming
  Operations Research Letters, 1982
• The Complexity of Enumeration and Reliability Problems
  SIAM Journal on Computing, 1979
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
  Operations Research, 1973
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
  Journal of the Society for Industrial and Applied Mathematics, 1961