Cooperation scheme visualization: coordinate assignment

  • Юрий Михайлович Васильев Saint-Petersburg state University of Economics
Keywords: directed hierarchical acyclic graph, drawing graph, Sugiyama method, node coordinates, branch and bound algorithm

Abstract

Purpose: the author considers the problem of assigning coordinates to the vertices at hierarchical graph placement for 2D drawing. Discussion: сoordinate assignment is the stage of the Sugiyama method for drawing directed acyclic hierarchical graph following the edge crossing minimization stage. The solution of the problem is 2D coordinates of each vertex, taking into account the fixed order of vertices on each layer. Results: the author discussed and mathematically formalized the set of aesthetic drawing criteria. The author confirmed the exact mathematical statement of the problem in the form of mixed-integer programming. Numerical evaluation demonstrates effectiveness and correctness of the proposed approach.

Downloads

Download data is not yet available.
Published
2018-03-20
How to Cite
Васильев, Ю. М. (2018). Cooperation scheme visualization: coordinate assignment. Modern Economics: Problems and Solutions, 2, 18-29. https://doi.org/10.17308/meps.2018.2/1829
Section
Mathematical Methods in Economics