Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope.

Ulrich Kortenkamp

Published in: Discret. Comput. Geom. (1997)

Keyphrases

lattice points
hamiltonian cycle
stable set
convex hull
directed graph
integer points
random walk
artificial intelligence
np complete
evolutionary algorithm
traveling salesman problem
geometric properties
semidefinite
learning algorithm
genetic algorithm
data sets
database