3 papers
cs.DM2017
Some classes of graphs that are not PCGs
Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti +1
A graph is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and two non-negative real numbers and , $d_{min} \leq d_{max}…
cs.DC2016
Topology recognition with advice
Emanuele Guido Fusco, Andrzej Pelc, Rossella Petreschi
In topology recognition, each node of an anonymous network has to deterministically produce an isomorphic copy of the underlying graph, with all ports correctly marked. This task i…
cs.DM2011
On relaxing the constraints in pairwise compatibility graphs
Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri
A graph is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree and two non-negative real numbers and such that each leaf $…