5 papers
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…
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…
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.…
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…
Inverse Galois Problem and Significant Methods
Fariba Ranjbar, Saeed Ranjbar
The inverse problem of Galois Theory was developed in the early 1800 s as an approach to understand polynomials and their roots. The inverse Galois problem states whether any finit…