Automata-formalization for graphs of bounded rank-width

Bc. Robert Ganian

Diplomová práce

Anotace:

Rank-width is a new structural measure of graphs introduced by Oum and Seymour. The outcome of this work is to define and prove a "parse-tree" characterization of the graphs of bounded rank-width, and a corresponding analogue of the Myhill-Nerode theorem. (Similar characterizations exist, e.g. for the graphs of bounded tree-width or bounded branch-width.) This effort aims at creating a schematic framework for design of efficient algorithms on graphs of bounded rank-width, using the tools of automata theory.

Abstract:

Rank-width is a new structural measure of graphs introduced by Oum and Seymour. The outcome of this work is to define and prove a "parse-tree" characterization of the graphs of bounded rank-width, and a corresponding analogue of the Myhill-Nerode theorem. (Similar characterizations exist, e.g. for the graphs of bounded tree-width or bounded branch-width.) This effort aims at creating a schematic framework for design of efficient algorithms on graphs of bounded rank-width, using the tools of automata theory.

Keywords

Rank-width, Parse trees, Tree automata, Graphs of bounded Rank-width

Jazyk práce: angličtina

Datum vytvoření / odevzdání či podání práce: 22. 5. 2008

Obhajoba závěrečné práce

• Obhajoba proběhla 1. 7. 2008
• Vedoucí: prof. RNDr. Petr Hliněný, Ph.D.
• Oponent: doc. Mgr. Jan Obdržálek, PhD.

Masarykova univerzita

Fakulta informatiky

Magisterský studijní program / obor:
Informatika / Teoretická informatika