Efficiently enumerating all the extreme points of a polytope identified by a system of linear inequalities is a well-known challenge issue. We consider a special case and present an algorithm that enumerates all the extreme points of a bisubmodular polyhedron in $\mathcal{O}(n^4|V|)$ time and $\mathcal{O}(n^2)$ space complexity, where $n$ is the dimension of underlying space and $V$ is the set of outputs. We use the reverse search and signed poset linked to extreme points to avoid the redundant search. Our algorithm is a generalization of enumerating all the extreme points of a base polyhedron which comprises some combinatorial enumeration problems.

翻译：高效枚举由线性不等式系统定义的多面体的所有极点是一个公认的挑战性问题。我们考虑一种特例，并提出一个算法，可在 $\mathcal{O}(n^4|V|)$ 时间内和 $\mathcal{O}(n^2)$ 空间复杂度下枚举双亚模多面体的所有极点，其中 $n$ 为底层空间的维度，$V$ 为输出集合。我们利用反向搜索和与极点关联的符号偏序集来避免冗余搜索。该算法是对基多面体（涵盖若干组合枚举问题）所有极点枚举的推广。