Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Phylogenetic k-Root and Steiner k-Root
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Ptolemaic graphs and interval graphs are leaf powers
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On relaxing the constraints in pairwise compatibility graphs
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Exploring pairwise compatibility graphs
Theoretical Computer Science
| Hi-index | 5.23 |
A graph G=(V,E) is called a pairwise compatibility graph (PCG) if there exists a tree T, a positive edge-weight function w on T, and two non-negative real numbers d"m"i"n and d"m"a"x, d"m"i"n=