1 citations · 1 across the 1 of their papers we have counts for
1 paper
Tiziana Calamoneri, Blerina Sinaimeri, Mattia Gastaldello
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' and `D' such that each leaf `u' of T is a node…