Bc. Matúš Bezek
Bachelor's thesis
Charakterizace DAG-depth orientovaného grafu
Characterizing DAG-depth of directed graphs
Abstract:
Študujeme DAG-depth, štrukturálnu hĺbkovú mieru orientovaných grafov, ktorá prirodzene rozširuje tree-depth neorientovaných grafov. Definujeme DAG-depth dekompozíciu ako policajnú stratégiu vo verzii hry na policajtov a zlodeja, kde položený policajt ostane v danom vrchole do konca hry. DAG-depth dekompozícia sa vzťahuje k DAG-depth podobne ako eliminačný strom k tree-depth. Poskytujeme definíciu zlúčiteľných …moreAbstract:
We study DAG-depth, a structural depth measure of directed graphs, which naturally extends the tree-depth of ordinary graphs. We define a DAG-depth decomposition as a strategy for the cop player in the lift-free version of the cops-and-robber game on directed graphs. The DAG-depth decomposition is related to DAG-depth in a similar way as an elimination tree is related to the tree-depth. We provide …more
Language used: English
Date on which the thesis was submitted / produced: 19. 5. 2016
Identifier:
https://is.muni.cz/th/gprvc/
Thesis defence
- Date of defence: 22. 6. 2016
- 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
-
Structural and geometric graph theory and algorithmic metatheorems
Filip Pokrývka -
Quasirandomness in graph theory
Daniel Iľkovič -
FO interpretations in restricted graph classes
Matúš Bezek -
Efficient solvability of graph MSO properties
Jakub Gajarský