Graduate Studies


First Advisor

Jitender Deogun

Date of this Version

Fall 10-22-2021


Al-saadi, O 2021, 'A novel method to find diameter on asteroidal-triple free graphs,' Master's Thesis, University of Nebraska, Lincoln.


A THESIS Presented to the Faculty of The Graduate College at the University of Nebraska In Partial Fulfillment of Requirements For the Degree of Master of Science, Major: Computer Science, Under the Supervision of Professor Jitender Deogun: Lincoln, Nebraska: October, 2021

Copyright © 2021 Oleksiy Al-saadi


In the past, it has been shown that the diameter of some asteroidal triple-free (AT-free) graphs can be found in O(m^(3/2))-subquadratic time. We prove lower and upper bounds for diameter and devise a O(n^2) algorithm to find the diameter of all AT-free graphs by exploiting relative eccentricities between dominating pair nodes.

Advisor: Jitender Deogun