Cooperation scheme visualization: a new hybrid algorithm for edge crossing minimization in graph drawing problem
Автор: Vasiliev Yu.M., Fridman G.M.
Журнал: Известия Санкт-Петербургского государственного экономического университета @izvestia-spgeu
Рубрика: Методология и инструментарий управления
Статья в выпуске: 1-2 (103), 2017 года.
Бесплатный доступ
A new method (hybrid algorithm) is advocated in the paper for edge crossing minimization problem in graph drawing taking into account the upper boundary for computing time. Systematic numerical calculations demonstrated significant reduction for edge crossing number for a wide range of graph characteristics.
Directed hierarchical acyclic graph, edge crossing, heuristic algorithms, clustering
Короткий адрес: https://sciup.org/14875816
IDR: 14875816
Статья научная
