Dimension reduction methods in graph drawing problem

Abstract

Graph is a standard data structures mainly used to impose relations in a connected network of objects. Graphs are drawn mostly in ℝ2 space with vertices as points and edges as straight lines connecting vertices. Methods for reduction of dimension are intended for projecting high-dimensional data to a new representation in low-dimensional space. Objective of this work is to use selected dimension reduction methods as a main step in construction of a graph drawing. Graph drawings by selected methods are compared to each other and also to the classical approach presented by Kamada and Kawai.