Multiterminal Metric Problems in Undirected Graphs

Student: Iskhakov Timur

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Year of Graduation: 2018

We study a multiterminal generalization of a well-known graph problem — shortest path problem. The considered problem is to find the closest pair of vertices among a subset of the vertices of the graph. We propose several algorithms on the variations of multiterminal shortest path problem.

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