- Гребенюк, Богдан Вікторович (2018) Modification of the analytical gamma-algorithm for the flat layout of the graph Computer Science & Software Engineering : Proceedings of the 1st Student Workshop (CS&SE@SW 2018), Kryvyi Rih, Ukraine, November 30, 2018 (2292). pp. 46-54. ISSN 1613-0073
Preview |
Text
paper03.pdf - Published Version Download (744kB) | Preview |
Abstract
The planarity of graphs is one of the key sections of graph theory. Although a graph is an abstract mathematical object, most often it is graph visualization that makes it easier to study or develop in a particular area, for example, the infrastructure of a city, a company’s management or a website’s web page. In general, in the form of a graph, it is possible to depict any structures that have connections between the elements. But often such structures grow to such dimensions that it is difficult to determine whether it is possible to represent them on a plane without intersecting the bonds. There are many algorithms that solve this issue. One of these is the gamma method. The article identifies its problems and suggests methods for solving them, and also examines ways to achieve them.
| Item Type: | Article |
|---|---|
| Keywords: | discrete structures, graph theory, planarity |
| Subjects: | Science and knowledge. Organization. Computer science. Information. Documentation. Librarianship. Institutions. Publications > 5 Мathematics. natural sciences > 51 Mathematics |
| Divisions: | Institute for Digitalisation of Education > Joint laboratory with SIHE “Kryvyi Rih National University” |
| Depositing User: | Сергій Олексійович Семеріков |
| Date Deposited: | 04 Jan 2019 22:13 |
| Last Modified: | 23 Aug 2019 12:15 |
| URI: | https://lib.iitta.gov.ua/id/eprint/713302 |
Downloads
Downloads per month over past year
Actions (login required)
 |
View Item |