A mathematical mystery that remained unsolved across years of academic publications has finally been cracked with a simple polynomial-time algorithm.

Cluster vertex deletion is a notorious problem used to find hidden groups within complex networks like social circles or protein interactions. This specific version for chordal graphs was long thought to be much harder or potentially impossible to solve efficiently. The new algorithm provides a definitive way to clean up noisy data and find the true underlying clusters without massive computing power. Researchers can now apply this to large-scale biological datasets that were previously too complex to process accurately. This solution closes a major gap in the theoretical foundation of graph theory and network analysis.