Zpět na vyhledávání

Bc. Michal Románek

Bachelor's thesis

Parametrizované algoritmy pro grafy s omezenou modulární šířkou

Parameterized algorithms for modular-width
Abstract:
Táto práca sa zaoberá zložitosťou niektorých výpočetne náročných problémov na grafoch s obmedzenou "neighborhood diversity" a modulárnou šírkou. Nachádza sa v nej krátky súhrn súčasného stavu riešenej problematiky a často používaných techník riešenia problémov na grafoch s obmedzenou "neighborhood diversity". Následne sú tieto techniky aplikované na vytvorenie vlastných algoritmov na riešenie problémov …more
Abstract:
This thesis is dealing with the complexity of some hard problems on graphs bounded by neighborhood diversity and modular-width. We provide a short overview of the current state of art and commonly used techniques for solving problems on graphs bounded by neighborhood diversity. Then we apply these and come up with original algorithms for problems on graphs bounded by modular-width, namely the independent …more
 

Keywords

parameterized complexity neighborhood diversity modular-width edge dominating set dominating set independent set
 
Language used: English
Date on which the thesis was submitted / produced: 23. 5. 2016
Identifier: https://is.muni.cz/th/tobmd/

Thesis defence

  • Date of defence: 24. 6. 2016
  • Supervisor: RNDr. Jakub Gajarský, Ph.D.
  • Reader: doc. Mgr. Jan Obdržálek, PhD.

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

Bachelor programme / field:
Applied Informatics / Applied Informatics

Theses on a related topic

List of theses with an identical keyword.
  • No theses on a related topic available.