Citation Graph Visualization Program

Student: Gryaznov Nikita

Educational Programme: Software Engineering (Bachelor)

Final Grade: 9

Year of Graduation: 2016

This paper is dedicated to visualization of softly clustered citation graphs. In this paper, we examine approaches to the visualization of graphs, In particular, different 2D force-directed layout algorithms and their optimization techniques are reviewed. In addition, different methods of visualization of graph cluster structure are described. The aim of the work was to develop citation graph visualization program. During the developing of the program a layout algorithm for softly clustered graphs was formulated. And also the Bubbles Sets algorithm (2009) was used. This algorithm allows us to visualize cluster over placed graph nodes. The program is developed as web-application. This approach allows different users to use simultaneously and makes it cross-platform and accessible. This paper contains 40 pages, 3 chapters, 7 illustrations, 1 table, 34 bibliography items,4 appendices. Keywords: graph visualization, soft clustering, force algorithms, Bubble Sets.

Full text (added May 27, 2016)

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