1 paper · 1 filter
Tiziana Calamoneri, Manuel Lafond, Angelo Monti +1
A graph G is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval I, such that each leaf of the tree is a vertex of the graph, and there i…