Complexity of diameter on AT-free graphs is linear

We exploit properties of dominating pair sets (polar pairs) in asteroidal triple-free (AT-free) graphs to compute diameter in linear-time. As a consequence, we improve the best known running time of the well-known graph theoretical problems of finding a simplicial vertex and triangle recognition in general graphs to $O(n^2)$.