DeepAI AI Chat
Log In Sign Up

Polyhedral Properties of the Induced Cluster Subgraphs

by   Seyedmohammadhossein Hosseinian, et al.
Texas A&M University

A cluster graph is a graph whose every connected component is a complete graph. Given a simple undirected graph G, a subset of vertices inducing a cluster graph is called an independent union of cliques (IUC), and the IUC polytope associated with G is defined as the convex hull of the incidence vectors of all IUCs in the graph. The Maximum IUC problem, which is to find a maximum-cardinality IUC in a graph, finds applications in network-based data analysis. In this paper, we derive several families of facet-defining valid inequalities for the IUC polytope. We also give a complete description of this polytope for some special classes of graphs. We establish computational complexity of the separation problem for most of the considered families of valid inequalities and explore the effectiveness of employing the corresponding cutting planes in an integer (linear) programming framework for the Maximum IUC problem through computational experiments.


Total Coloring and Total Matching: Polyhedra and Facets

A total coloring of a graph G = (V, E) is an assignment of colors to ver...

On the Complexity of Some Facet-Defining Inequalities of the QAP-polytope

The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem t...

The polytope of legal sequences

A sequence of vertices in a graph is called a (total) legal dominating s...

Polyhedral study of the Convex Recoloring problem

A coloring of the vertices of a connected graph is convex if each color ...

Facets of the Total Matching Polytope for bipartite graphs

The Total Matching Polytope generalizes the Stable Set Polytope and the ...

An Experimental Study of ILP Formulations for the Longest Induced Path Problem

Given a graph G=(V,E), the longest induced path problem asks for a maxim...

A Polyhedral Study for the Cubic Formulation of the Unconstrained Traveling Tournament Problem

We consider the unconstrained traveling tournament problem, a sports tim...