The vertex set of a 01-polytope is strongly P-enumerable
- 31 October 1998
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 11 (2) , 103-109
- https://doi.org/10.1016/s0925-7721(98)00021-2
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedronComputational Geometry, 1997
- Efficient enumeration of the vertices of polyhedra associated with network LP'sMathematical Programming, 1994
- Finding all the perfect matchings in bipartite graphsApplied Mathematics Letters, 1994
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedraDiscrete & Computational Geometry, 1992
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979