|
|
Information for patients about the treatment mode after hip surgery - Total joint replacement
Ondráčková, Eva ; Nikodemová, Hana (advisor) ; Tomová, Šárka (referee)
My bachelor thesis called "Patients' knowledge of therapeutic mode after surgery of hip joint - total endoprosthesis" deals with a problem of education of patients in case of mode after surgery on Orthopaedic department in St. Zdislava hospital in Mostiště. A theoretic part is focused on summary of findings about hip joint, causes of surgery, types of endoprosthesis, preoperative and postoperative cares, rehabilitation and potential complications after surgery of hip joint. In a practical part, there is introduced a method of research on Orthopaedic department, whose aim is to get into degree of patients' knowing, form of education and simple keeping of preventive measures. In a conclusion of my thesis the results of research and assessment of research acquisiton into practice are summarized.
|
|
|
Výpočetní složitost v teorii grafů
Ondráčková, Eva ; Kratochvíl, Jan (advisor) ; Sgall, Jiří (referee)
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one can be made isomorphic to the other by a sequence of switches. In this thesis, we study the computational complexity the problem S(P) for a certain graph property P: given a graph G, determine if G is switching-equivalent to a graph having P. First, we give an overview of known results, including both properties P for which S(P) is polynomial, and those for which S(P) is NP-complete. Then we show the NP-completeness of the following problem for each c (0; 1): determine if a graph G can be switched to contain a clique of size at least cn, where n is the number of vertices of G. We also study the problem if, for a xed graph H, a given graph is switching-equivalent to an H-free graph. We show that for H isomorphic to a claw, the problem is polynomial. Further, we give a characterization of graphs witching-equivalent to a K1;2-free graph by ten forbidden induced subgraphs, each having ve vertices.
|
|
|
Information for patients about the treatment mode after hip surgery - Total joint replacement
Ondráčková, Eva ; Nikodemová, Hana (advisor) ; Tomová, Šárka (referee)
My bachelor thesis called "Patients' knowledge of therapeutic mode after surgery of hip joint - total endoprosthesis" deals with a problem of education of patients in case of mode after surgery on Orthopaedic department in St. Zdislava hospital in Mostiště. A theoretic part is focused on summary of findings about hip joint, causes of surgery, types of endoprosthesis, preoperative and postoperative cares, rehabilitation and potential complications after surgery of hip joint. In a practical part, there is introduced a method of research on Orthopaedic department, whose aim is to get into degree of patients' knowing, form of education and simple keeping of preventive measures. In a conclusion of my thesis the results of research and assessment of research acquisiton into practice are summarized.
|
|
|
Výpočetní složitost v teorii grafů
Ondráčková, Eva ; Kratochvíl, Jan (advisor) ; Sgall, Jiří (referee)
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one can be made isomorphic to the other by a sequence of switches. In this thesis, we study the computational complexity the problem S(P) for a certain graph property P: given a graph G, determine if G is switching-equivalent to a graph having P. First, we give an overview of known results, including both properties P for which S(P) is polynomial, and those for which S(P) is NP-complete. Then we show the NP-completeness of the following problem for each c (0; 1): determine if a graph G can be switched to contain a clique of size at least cn, where n is the number of vertices of G. We also study the problem if, for a xed graph H, a given graph is switching-equivalent to an H-free graph. We show that for H isomorphic to a claw, the problem is polynomial. Further, we give a characterization of graphs witching-equivalent to a K1;2-free graph by ten forbidden induced subgraphs, each having ve vertices.
|
guest ::
RSS feed.