4c5ab92b-00c5-4ed8-ae1d-6c187e83d06320211116090356475naun:naunmdt@crossref.orgMDT DepositInternational Journal of Applied Mathematics and Informatics2074-127810.46300/91014http://www.naun.org/cms.action?id=3064319202131920211510.46300/91014.2021.15https://www.naun.org/cms.action?id=23306V.N.KasyanovLaboratory for Program Construction and Optimization Institute of Informatics Systems Novosibirsk, RussiaGraphs are the most common abstract structure encountered in computer science and are widely used for structural information visualization. In the paper, we consider practical and general graph formalism of so called hierarchical graphs and present the Higres and ALVIS systems aimed at supporting of structural information visualization on the base of hierarchical graph models.1116202111162021788413https://www.naun.org/main/UPress/ami/2021/a262013-013(2021).pdf10.46300/91014.2021.15.13https://www.naun.org/main/UPress/ami/2021/a262013-013(2021).pdfaiSee http://www.absint.com/aisee/ C. Demetrescu, I. Finocchi. “A gener al-purpose logic-based visualization framework”, Proc. of the 7th I nternat. Conf. in Centr al Europe on Co mputer Graphics, Visualization and Interactive Digital Media (WSCG’99), Plzen, 1999, pp. 55–62. 10.1007/3-540-45875-1_2C. Demetrescu, I. Finocchi, J. T. Stasko. “Specifying Algorithm Visualizations: Interesting Events or State Mapping?”, Lecture Notes in Computer Science, Vol. 2269, 2002, pp.16–30. P. Eades, “A heuristic for graph drawing”, Congressus Numerantium, Vol. 42, 1984, 149-160. 10.1007/3-540-60313-1_145Q.W. Feng, R.F. Cohen, P. Eades, “Planarity for clustered graphs”, Lecture Notes in Computer Science, Vol. 979, 1995, pp. 213-226. 10.1007/3-540-58950-3_379M. Fröhlich, M. Werner, “Demonstration of t he interactive graph visualization system daVinci”, Lecture Notes in Com puter Science, Vol. 959, 1995, pp. 266-269. D.S. Gordeev.”Graph algorithm visualization: inter pretation of algorithm as a pr ogram”, Informatics in Resear ch and E ducation, Novosibirsk, IIS, 2012, pp.149-160. (in Russian). D. Harel, “On visual formalism, Comm”. ACM, Vol. 31, No. 5, 1988, pp. 514-530. 10.1109/2945.841119I. Herman, G. Melançon, M.S. Marshall, “Graph visualization and navigation in inf ormation visualization: a surve y”, IEEE Trans. on Visualization and Computer Graphics, Vol. 6, 2000, pp. 24-43. Higres http://pco.iis.nsk.su/higres 10.1007/3-540-62495-3_51M. Himsolt, “The Graphlet system (system demonstration)”, Lecture Notes in Computer Science, Vol. 1190, 1997, pp. 233-240. V.N. Kasyanov. “Hierarchical graphs and gr aph models: problems of visual processing”, Problems of informatics systems and programming, Novosibirsk, IIS, 1999, pp. 7-32. (in Russian). V.N. Kasyanov, V.A. Evstigneev, Graph T heory for Programmers. Algorithms for Processing T rees, Kluwer Academic Publishers, 2000. 432 p. V.N. Kasyanov, V.A. Evstigneev. Graphs in Pr ogramming: Processing, Visualization and Application, St. Petersburg, BHV-Petersburg, 2003, 1104 p. (In Russian). V.N. Kasyanov, E.V. Kasyanova, Visualization of Graphs and Gr aph Models, Siberian Scientific Publ., 2010, 123 p.(in Russian). V.N. Kasyanov, I.A. Lisitsyn. “Hierarchical graph models and vis ual processing”, Proc.of Conference on Software: Theory and Practice. 16th IFIP World Computer Congress 2000, Beijing, PH EI, 2000, pp. 179- 182. 10.1007/3-540-45875-1_1A. Kerren and J. Stasko. “Algorithm animation - introduction", Lecture Notes in Computer Science, Vol. 2269, 2002, pp. 1-15. 10.1007/bfb0021822B. Madden, P. Madden, S. Powers, M. Himsolt, “Portable graph layout and editing”, Lecture Notes in Computer Science, Vol. 1027, 1996, pp. 385-395. G. Sander, “Graph layout through the VCG tool”, Lectur e Notes in Computer Science, Vol. 959, 1995, pp.194-205. 10.1109/21.108304K. Sugiyama, K. Misue, “Visualization o f structured digraphs”, IEEE Trans. on Systems, Man and Cybernetics, Vol. 21, No. 4, 1999, pp. 876- 892. yEd http://www.yworks.com/en/