Zpět na vyhledávání

Bc. Matúš Bezek

Master's thesis

FO interpretations in restricted graph classes

FO interpretations in restricted graph classes
Abstract:
Skúmame interpretácie prvého rádu na triedach grafov. Našou hlavnou motiváciou je nájsť spôsob, ako rozšíriť bohatstvo tried grafov, pre ktoré je problém overovania modelov prvého rádu je v triede FPT. Zhŕňame vlastnosti grafov, ktoré sú asymptoticky zachované pri interpretáciách prvého rádu. Špeciálne sa venujeme near-uniform grafovým triedam, čo sú presne tie triedy, ktoré sú interpretovateľné z …more
Abstract:
We study first-order interpretations of graph classes. Our primary motivation is to find a way of extending the variety of graph classes for which the first-order model checking problem is fixed-parameter tractable. We summarize some of the graph properties which are asymptotically preserved under first-order interpretations. We pay special attention to near-uniform graph classes, which are exactly …more
 

Keywords

graph graph theory logic first-order logic near-uniform clique-width shrub-depth grafy teória grafov logika logika prvého rádu
 
Language used: English
Date on which the thesis was submitted / produced: 12. 12. 2018
Identifier: https://is.muni.cz/th/uz08k/

Thesis defence

  • Date of defence: 8. 2. 2019
  • Supervisor: prof. RNDr. Petr Hliněný, Ph.D.
  • Reader: doc. Mgr. Jan Obdržálek, PhD.

Citation record

Cite this text

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 informatiky
Složka Reference to the local database directory of the institution

Masaryk University

Faculty of Informatics

Master programme / field:
Informatics / Theoretical Informatics

Theses on a related topic

List of theses with an identical keyword.
All theses