1 problem

0 votes0 replies0 views
Facet-defining conjecture for clique inequalities in the two-level graph partitioning polytope
Let $G=(V,E)$ be the graph and let $k,k'$ be the partition parameters, with $r$ , $r'$ , and $R$ as defined for the corresponding clique inequalities. For a clique $C$ , write $y(C)$ …
Conjectureopenclique-inequalities graph-partitioning polyhedral-combinatoricsarXiv posted 2 days ago

Facet-defining conjecture for clique inequalities in the two-level graph partitioning polytope