The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown.

Michel X. Goemans Leslie A. Hall

Published in: IPCO (1996)

Keyphrases

np hard
facet defining inequalities
convex hull
facet defining
directed graph
database schemes
lattice points
np complete
graph mining
stable set
graph properties
search space
objective function
lower bound
frequent subgraphs