Computer Science and Engineering, Department of


First Advisor

Dr. Jitender Deogun

Date of this Version

Fall 5-5-2021

Document Type



Cuong, Than. Separator of Diametral Path Graphs. MS Thesis. University of Nebraska-Lincoln, 2021. May 2021.


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: May, 2021

Copyright © 2021 Cuong V. Than


Nowadays, graph algorithms have been applied to many practical issues such as networking, very large-scale integration (VLSI), and transport systems, etc. Constructing an algorithm to find a maximum independent set (MIS) is one of the first NP-Hard problems which have been studied for a long time. Most scientists believe that there is no polynomial-time algorithm for this problem in general graphs. However, many efficient algorithms and approximation schemes to resolve the MIS problem are found in some special graph classes. In this thesis, we are going to introduce a separator construction for a diametral path graph. By using a property of the separator, we then obtain a polynomial-time algorithm to find a MIS in diametral path graphs with bounded degree. Additionally, in diametral path graphs, we reduce the approximate MIS problem to finding the solution with the constraint of bounded diameter. This reduction opens a promising approach to an approximate solution for the MIS problem in the future.

Adviser: Jitender Deogun