|
|
Persistent data structures
Kupec, Martin ; Mareš, Martin (advisor) ; Straka, Milan (referee)
This thesis discusses persistent data structures, that is structures which preserve their own history. We focus on pointer-based structures, where it is possible to reach both full and partial persistence in constant amortized time and space per operation. Persistent arrays are also discussed, but the existence of optimal persistent arrays remains an open problem. We also include specific applications of the general techniques and also examples of use of persistent data structures.
|
|
|
Meze pro vzdálenostně podmíněné značkování grafů
Kupec, Martin ; Fiala, Jiří (advisor) ; Dvořák, Zdeněk (referee)
We study the complexity of the λ−L(p, q)-labelling problem for fixed λ, p, and q. The task is to assign vertices of a graph labels from the set {0, . . . , λ} such that labels of adjacent vertices differ by at least p while vertices with a common neighbor have different labels. We use two different reductions, one from the NAE-3SAT and the second one from the edge precoloring extension problem. 1
|
|
|
Meze pro vzdálenostně podmíněné značkování grafů
Kupec, Martin ; Fiala, Jiří (advisor) ; Dvořák, Zdeněk (referee)
We study the complexity of the λ−L(p, q)-labelling problem for fixed λ, p, and q. The task is to assign vertices of a graph labels from the set {0, . . . , λ} such that labels of adjacent vertices differ by at least p while vertices with a common neighbor have different labels. We use two different reductions, one from the NAE-3SAT and the second one from the edge precoloring extension problem. 1
|
|
|
Persistent data structures
Kupec, Martin ; Straka, Milan (referee) ; Mareš, Martin (advisor)
This thesis discusses persistent data structures, that is structures which preserve their own history. We focus on pointer-based structures, where it is possible to reach both full and partial persistence in constant amortized time and space per operation. Persistent arrays are also discussed, but the existence of optimal persistent arrays remains an open problem. We also include specific applications of the general techniques and also examples of use of persistent data structures.
|
|
|
Analysis and optimization of a functioning e-shop
Kupec, Martin ; Lohr, Václav (advisor) ; Zdeněk, Zdeněk (referee)
The thesis Analysis and optimization of a functioning e-shop in the theoretical part describes the general prerequisites for successful internet marketing and possible ways to analyze important data. The practical part is an analysis of e-shop Company Oxalis dessous. The analysis is performed after the marketing, operational and in terms of the method of providing information. On the basis of the chosen strategy, this aims to improve important parameters of internet commerce. Specifically are traffic, conversions, keyword positions in the search engines and breadth of link portfolio. The chosen strategy is its realization is subjected to analysis using analytical and measuring tools to examine its effectiveness. From the theoretical foundations verified in practical part is based on the draft final recommendations, which can be used for online stores selling the goods
|
guest ::
