Bc. Filip Pokrývka
Bachelor's thesis
FO properties of geometric graphs
FO properties of geometric graphs
Abstract:
V teórií konečných modelov sa v súčasnosti výskum sústreďuje hlavne na hľadanie podtried grafov, kde je problém overovania modelov (model checking problem) parametrizovateľný (FPT), pretože je dokázané, že na triede všetkých grafov je problém overovania modelov neparametrizovateľný (non-FPT), pokiaľ platí hypotéza o expponenciálnom čase. V tejto práci sa sústreďujeme hľavne na permutačné grafy, box …moreAbstract:
In finite model theory, the first-order model checking problem on graphs is nowadays popular. The research has focused on finding subclasses of graphs on which FO model checking is fixed-parameter tractable, since it is proven that FO model checking on general graphs is non-FPT, unless the Exponential Time Hypothesis fails. In this work, we focus on permutation graphs, box graphs and disk graphs. We …more
Language used: English
Date on which the thesis was submitted / produced: 25. 5. 2017
Identifier:
https://is.muni.cz/th/k6riw/
Thesis defence
- Date of defence: 27. 6. 2017
- Supervisor: prof. RNDr. Petr Hliněný, Ph.D.
- Reader: Dr. rer. nat. Achim Blumensath
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsBachelor programme / field:
Informatics / Mathematical Informatics
Theses on a related topic
-
Limits of efficient FO model checking of geometric graphs
Filip Pokrývka -
Limits of efficient FO model checking of geometric graphs
Filip Pokrývka