Papers › Polyhedral Properties of the Induced Cluster Subgraphs
Polyhedral Properties of the Induced Cluster Subgraphs
Seyedmohammadhossein Hosseinian, Sergiy Butenko
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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 {\sc 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 {\sc Maximum IUC} problem through computational experiments.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections