Year: 2026
Type: preprint
Abstract: We develop a branch-and-cut method for finding maximum distance-independent sets in graphs. Our approach solves a sequence of fixed-size clique problems, combining graph reductions with combinatorial and spectral bounds. We give a compact formulation, derive strengthened inequalities, establish conditions for using spectral information, and evaluate them in a comprehensive computational study.
Source: arXiv (Cornell University)
Authors: Abiad, Aida, Golak, Julian, Schulz, Arne
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7235072791
