Bc. Tomáš Novotný
Bachelor's thesis
Obstructions for graphs of low rank-depth
Obstructions for graphs of low rank-depth
Abstract:
V této práci studujeme rank-depth a její vlastnosti. Rank-depth jako taková ještě nebyla publikována, je založena na myšlenkách Geelen, Oum, DeVos a spol. Zadefinujeme rank-depth a rank-depth-decomposition společně s branch-depth a branch-depth-decomposition. Tyto hloubkové míry jsou rozšířením rank-width a branch-width. Jednou z výhod rank-depth-decomposition je to, že má mnohem menší poloměr dekompozičního …moreAbstract:
In this thesis we study rank-depth and its properties. The notion of rank-depth, so far unpublished, is based on ideas of Geelen, Oum, DeVos et al. We define rank-depth and rank-depth-decomposition along with branch-depth and branch-depth-decomposition. These depth measures are extensions of rank-width and branch-width. One of the advantages of rank-depth-decompositions is that they have considerably …more
Language used: English
Date on which the thesis was submitted / produced: 9. 1. 2017
Identifier:
https://is.muni.cz/th/cy1qm/
Thesis defence
- Date of defence: 15. 2. 2017
- Supervisor: prof. RNDr. Petr Hliněný, Ph.D.
- Reader: doc. Mgr. Jan Obdržálek, PhD.
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
-
Classes of bounded and unbounded twin-width
Jan Jedelský -
Implementation and optimization of a graph algorithm for computing rank-width
Miroslav Friedmanský -
Automata-formalization for graphs of bounded rank-width
Robert Ganian -
Parameterized Algorithms on Width Parameters of Graphs
Robert Ganian