Research on Pairwise Compatibility Graphs: Current State and Open Problems
Speaker: Md. Saidur Rahman – Dhaka, BangladeshTopic(s): Computational Theory, Algorithms and Mathematics
Abstract
Let T be an edge weighted tree and dmin, dmax be two non-negative real numbers where dmin ≤ dmax. The pairwise compatibility graph (PCG) of T for dmin, dmax is a graph G such that each vertex of G corresponds to a distinct leaf of T and two vertices are adjacent in G if and only if the weighted distance between their corresponding leaves lies within the interval [dmin, dmax]. A graph G is a PCG if there exist an edge weighted tree T and suitable dmin, dmax such that G is a PCG of T. The class of pairwise compatibility graphs was introduced to model evolutionary relationships among a set of species. Since not all graphs are PCGs, researchers become interested in recognizing and characterizing PCGs. In this talk I review the results regarding PCGs and some of its variants. I will also discuss some open problems which we are considering over the years. The talk is based on my joint works with M. N. Yanhaona, M. S. Bayzid, K. S. M. T. Hossain, S. A. Salma, S. Durocher, D. Mondal, S. Ahmed, B. B. Papan, P. B. Pranto and S. A. Hakim.About this Lecture
Number of Slides: 70Duration: 45 minutes
Languages Available: English
Last Updated:
Request this Lecture
To request this particular lecture, please complete this online form.
Request a Tour
To request a tour with this speaker, please complete this online form.
All requests will be sent to ACM headquarters for review.