Bc. Dominik Melicher
Bachelor's thesis
Twin-width of planar graphs
Twin-width of planar graphs
Abstract:
Twin-width je nový grafový atribút prvýkrát zavedený v roku 2020. Je v poslednej dobe intenzívne skúmaný. V tejto práci uvedieme prehľad o twin-width sústredený na posledné pokusy nájsť vrchnú a spodnú hranicu pre rovinné grafy. Následne ukážeme implementácie pre 3 momentálne najlepšie algoritmy na hľadanie kontrakčných sekvencií na rovinných grafoch a porovnáme ich výkony.Abstract:
Twin-width is a new graph attribute introduced in 2020, that is currently being heavily researched. In this thesis, we give an overview of twin-width, focusing on the most recent attempts to find upper and lower bounds for planar graphs. Afterward, we show implementations for the current 3 best algorithms for finding a contraction sequence on planar graphs and compare their performances in practice …more
Language used: English
Date on which the thesis was submitted / produced: 15. 12. 2022
Identifier:
https://is.muni.cz/th/mpc77/
Thesis defence
- Date of defence: 31. 1. 2023
- Supervisor: prof. RNDr. Petr Hliněný, Ph.D.
- Reader: RNDr. Filip Pokrývka
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 / Informatics
Theses on a related topic
-
Twin-width of planar graphs
Jan Jedelský -
Classes of bounded and unbounded twin-width
Jan Jedelský -
Structural and geometric graph theory and algorithmic metatheorems
Filip Pokrývka