3 papers
cs.DS2025
Cluster deletion and clique partitioning in graphs with bounded clique number
Nicola Galesi, Tony Huynh, Fariba Ranjbar
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.NI2021
Counting and localizing defective nodes by Boolean network tomography
Nicola Galesi, Fariba Ranjbar
Identifying defective items in larger sets is a main problem with many applications in real life situations. We consider the problem of localizing defective nodes in networks throu…
cs.NI2018
Vertex-Connectivity Measures for Node Failure Identification in Boolean Network Tomography
Nicola Galesi, Fariba Ranjbar, Michele Zito
In this paper we study the node failure identification problem in undirected graphs by means of Boolean Network Tomography. We argue that vertex connectivity plays a central role.…