On the acyclic subgraph polytope.
Martin GrötschelMichael JüngerGerhard ReineltPublished in: Math. Program. (1985)
Keyphrases
- np hard
- stable set
- maximum matching
- lattice points
- knapsack problem
- convex hull
- database schemes
- np complete
- graph mining
- subgraph matching
- facet defining inequalities
- optimal solution
- linear programming
- hamiltonian cycle
- integer points
- graph databases
- semidefinite
- maximum weight
- special case
- search space
- lower bound
- hypertree decomposition
- frequent subgraph mining
- subtour elimination
- causal ordering
- graph data
- data sets
- integer programming
- objective function
- neural network