On Relaxing the Constraints in Pairwise Compatibility Graphs

@inproceedings{Calamoneri2012OnRT,
  title={On Relaxing the Constraints in Pairwise Compatibility Graphs},
  author={Tiziana Calamoneri and Rossella Petreschi and Blerina Sinaimeri},
  booktitle={WALCOM},
  year={2012}
}
A graph G is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree T and two non-negative real numbers dmin and dmax such that each leaf lu of T corresponds to a vertex u ∈ V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (lu, lv) ≤ dmax where dT (lu, lv) is the sum of the weights of the edges on the unique path from lu to lv in T . In this paper we analyze the class of PCG in relation with two particular subclasses resulting from the the cases where dmin… CONTINUE READING

Similar Papers

Loading similar papers…