Login / Signup
On the k-cut subgraph polytope.
Kalyan T. Talluri
Donald K. Wagner
Published in:
Math. Program. (1994)
Keyphrases
</>
facet defining inequalities
facet defining
stable set
lattice points
convex hull
maximum matching
graph mining
search space
directed graph
knapsack problem
valid inequalities
subgraph matching
hamiltonian cycle
graph properties
maximum weight
database
continuous variables
np hard
genetic algorithm