Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time.

Published in: Math. Oper. Res. (1997)

Keyphrases

fixed number
planar graphs
decision trees
special case
computational complexity
sufficient conditions
finite number
partial ordering
worst case
tree structure
approximation algorithms
linear inequalities
bounded degree
tree languages
linear programming