The vertex set of a 0/1-polytope is strongly P-enumerable.

Michael R. Bussieck Marco E. Lübbecke

Published in: Comput. Geom. (1998)

Keyphrases

vertex set
lattice points
weighted graph
stable set
undirected graph
inductive inference
convex hull
directed graph
maximum distance
multimedia
hypothesis space
random graphs