Compositions in the bipartite subgraph polytope.
Jean FonluptAli Ridha MahjoubJ. P. UhryPublished in: Discret. Math. (1992)
Keyphrases
- maximum matching
- stable set
- lattice points
- bipartite graph
- graph model
- real valued
- convex hull
- maximum weight
- graph databases
- graph mining
- search space
- facet defining inequalities
- semidefinite
- knapsack problem
- np hard
- directed graph
- frequent subgraph mining
- geometric properties
- graph partitioning
- extreme points
- graph data
- optimization problems
- hamiltonian cycle
- genetic algorithm
- data sets