• A
• A
• A
• ABC
• ABC
• ABC
• А
• А
• А
• А
• А
Regular version of the site
Campus inMoscow
Student
Title
Supervisor
Faculty
Educational Programme
Victoria Belous
Several Sweeps Algorithms for Recognizing Two Types of Interval Graphs
Applied Mathematics and Information Science
(Master’s programme)
7
2016
Interval graphs - one of the types of intersection graphs. The aim of this thesis is to study the algorithms of recognition interval and unit interval graphs, to implement them in the form of a computer program and conduct test calculations on graphs.

Interval Count - Count intersections of a plurality of intervals on the line. In other words, the interval graph vertices are some intervals on the line and any two vertices are connected by an edge if and only if their corresponding intervals intersect.

Each interval graph is chordal. A graph is chordal if each of its cycles, having four or more arcs have a chord, which is an edge connecting the two vertices are not adjacent in the cycle. An equivalent definition - if any cycle without chords has a maximum of three ribs.

The unit interval graphs - graph intersection intervals of the same length.

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.