Several Sweeps Algorithms for Recognizing Two Types of Interval Graphs

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.