Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Cluster deletion in cographs, permutation graphs, and graphs with bounded clique number
Nicola Galesi, Tony Huynh, Fariba Ranjbar +1
The Cluster Deletion problem asks for a minimum-size edge set whose deletion turns a graph into a disjoint union of complete graphs. Equivalently, the Clique Partition problem asks…
cs.DS2017
Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography
Nicola Galesi, Fariba Ranjbar
We study maximal identifiability, a measure recently introduced in Boolean Network Tomography to characterize networks' capability to localize failure nodes in end-to-end path meas…