VPVlada Puhkalo
Vlada Puhkalo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Vlada Puhkalo has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Vladimir Ryzhov
Санкт-Петербургский государственный морской технический университет
1 shared publication - Григорий Морицович Фридман
Санкт-Петербургский государственный университет сервиса и экономики
1 shared publication - Юрий Михайлович Васильев
Department of Applied Mathematics and Mathematical Methods in Economics, Saint Petersburg State University of Economics, Griboedov Canal Emb., 30-32, 191023 St. Petersburg, Russia
1 shared publication
Latest Publications
- Open Access
- 23 February 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (5) , 689
A Mixed-Integer Program for Drawing Orthogonal Hyperedges in a Hierarchical Hypergraph
This paper presents a new formulation and solution of a mixed-integer program for the hierarchical orthogonal hypergraph drawing problem, and the number of hyperedge crossings is minimized. The novel feature of the model is in combining several stages of the Sugiyama framework for graph drawing: vertex ordering, the assignment of vertices’ x-coordinates, and orthogonal hyperedge routing. The hyperedges of a hypergraph are assumed to be multi-source and multi-target, and vertices are depicted as rectangles with ports on their top and bottom sides. Such hypergraphs are used in data-flow diagrams and in a scheme of cooperation. The numerical results demonstrate the correctness and effectiveness of the proposed approach compared to mathematical heuristics. For instance, the proposed exact approach yields a reduction of the number of crossings compared to that obtained by using a mathematical heuristic for a dataset of non-planar graphs.- 23 February 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (5) , 689
Open AccessA Mixed-Integer Program for Drawing Orthogonal Hyperedges in a Hierarchical Hypergraph
This paper presents a new formulation and solution of a mixed-integer program for the hierarchical orthogonal hypergraph drawing problem, and the number of hyperedge crossings is minimized. The novel feature of the model is in combining several stages of the Sugiyama framework for graph drawing: vertex ordering, the assignment of vertices’ x-coordinates, and orthogonal hyperedge routing. The hyperedges of a hypergraph are assumed to be multi-source and multi-target, and vertices are depicted as rectangles with ports on their top and bottom sides. Such hypergraphs are used in data-flow diagrams and in a scheme of cooperation. The numerical results demonstrate the correctness and effectiveness of the proposed approach compared to mathematical heuristics. For instance, the proposed exact approach yields a reduction of the number of crossings compared to that obtained by using a mathematical heuristic for a dataset of non-planar graphs.