Mattia Gastaldello

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we address three related problems. One is the enumeration of all the maximal edge-induced chain subgraphs of a bipartite graph. We give bounds on their number and use them to establish the input-sensitive complexity of the enumeration problem. The second problem we treat is the minimum chain subgraph cover. Finally, we approach the problem of(More)
A graph G = (V, E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers d min and d max such that each leaf u of T is a node of V and there is an edge (u, v) ∈ E if and only if d min ≤ d T (u, v) ≤ d max where d T (u, v) is the sum of weights of the edges on the unique path from u to v in T. The(More)
  • 1