| dc.contributor.advisor | Vīksna, Juris | en_US |
| dc.contributor.author | Nāgele, Ieva | en_US |
| dc.contributor.other | Latvijas Universitāte. Datorikas fakultāte | en_US |
| dc.date.accessioned | 2015-03-24T08:56:11Z | |
| dc.date.available | 2015-03-24T08:56:11Z | |
| dc.date.issued | 2011 | en_US |
| dc.identifier.other | 18171 | en_US |
| dc.identifier.uri | https://dspace.lu.lv/dspace/handle/7/26925 | |
| dc.description.abstract | Darbs „Algoritmi grafu 3-līmeņu planarizācijai” apraksta izstrādi programmatūrai, kas ļauj veikt 3 līmeņos planarizējama koka paplašināšanu un atrast kokus, kurus nav iespējams planarizēt 3 līmeņos, kā arī nodrošina funkcijas koku izomorfisma pārbaudei.
Atslēgas vārdi: 3 līmeņu planarizācija, koku izomorfisms, C++. | en_US |
| dc.description.abstract | The paper "Algorithms for 3-layer planarization of graphs" describes the development of software which allows accomplish extension of three-layer planarization of tree and discovers trees that cannot be planarized in 3 layers.
The softwere also provide functions for verifying isomorphism of trees.
Keywords: three-layer planarization, tree isomorphism, C++. | en_US |
| dc.language.iso | N/A | en_US |
| dc.publisher | Latvijas Universitāte | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Datorzinātne | en_US |
| dc.title | Algoritmi grafu 3-līmeņu planarizācijai | en_US |
| dc.title.alternative | Algorithms for 3-layer planarization of graphs | en_US |
| dc.type | info:eu-repo/semantics/bachelorThesis | en_US |
