scientific article
From MaRDI portal
Publication:3753826
zbMath0612.90101MaRDI QIDQ3753826
Ulrich Faigle, R. Suletzki, Rainer Schrader
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An overview of graph covering and partitioning, Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations, Facet-defining inequalities for the simple graph partitioning polytope, Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes, The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts, The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations, Lifting theorems and facet characterization for a class of clique partitioning inequalities, A cutting-plane approach to the edge-weighted maximal clique problem
