activity
20242026
most citedVerifying message-passing neural networks via topology-based bounds tightening

2 citations · 2 across the 5 of their papers we have counts for

collaborators
Showing 2026 · math.OCShow all

1 paper · 2 filters

math.OC2026

Branch-and-price strikes back for the k-vertex cut problem

Fabio Ciccarelli, Fabio Furini, Christopher Hojny +1

Given an undirected graph, the k-vertex cut problem (k-VCP) asks for a minimum-cost set of vertices whose removal yields at least k connected components in the resulting graph. The…