The Weighted Indepentent Set Problem in Intreval Graphs

Student: Remizov Aleksandr

Faculty: Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod)

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Year of Graduation: 2020

This paper considers interval graphs that are applied in various fields of applied science. A number of real tasks can be represented as similar graphs. Interval graphs are widely spreaded in interval planning, molecular biology, and genetics. The given paper describes an algorithm for finding the maximum weighted independent set in interval graphs. The algorithm is iplemented in Python and described using the NetworkX library for working with graphs, and Plotly for visualizing the result of the algorithm. Besides, experiments were conducted with various parameters for generating intervals on the real line, such as the density of intervals, the distribution of endpoints using normal, exponential, and uniform distribution.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses