Zpět na vyhledávání

Bc. Jakub Gajarský, Ph.D.

Master's thesis

Efficient solvability of graph MSO properties

Efficient solvability of graph MSO properties
Abstract:
V priebehu rokov sa logika MSO ukázala ako vhodný jazyk na vyjadrovanie efektívne riešiteľných vlastností na obmedzených triedach grafov. V tejto práci podávame prehľad tried grafov, pre ktoré existujú efektívne algoritmy na overovanie modelu pre MSO logiku. Prínos práce spočíva v nájdení nového štrukturálneho parametru, ktorý je zúžením clique-width, a pre ktorý existuje rýchlejší algoritmus na overovenie …more
Abstract:
Over the time, MSO graph logic proved to be a suitable language for expressing efficiently solvable properties on restricted classes of graphs. In this work we review some classes of graphs, for which efficient algortithms for MSO model-checking are known. Our contribution consists of finding structural parameter which is a restriction of clique-width, and for which there exists faster MSO model-checking …more
 

Keywords

monadic second-order logic graph theory parametrized complexity Ehrenfeucht games kernelization
 
Language used: English
Date on which the thesis was submitted / produced: 9. 1. 2012
Identifier: https://is.muni.cz/th/w6sin/

Thesis defence

  • Date of defence: 9. 2. 2012
  • Supervisor: prof. RNDr. Petr Hliněný, Ph.D.
  • Reader: RNDr. Robert Ganian

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.