Original title: Výpočetní složitost v teorii grafů
Translated title: Computational complexity in graph theory
Authors: Melka, Jakub ; Kratochvíl, Jan (advisor) ; Fiala, Jiří (referee)
Document type: Master’s theses
Year: 2011
Language: cze
Abstract: [cze] [eng]

Keywords: Fixed parameter complexity; graph reconstruction; hypergraph; star systems; treewidth; hvezdné systémy; hypergraf; parametrizovaná složitost; rekonstrukce grafu; stromová šírka

Institution: Charles University Faculties (theses) (web)
Document availability information: Available in the Charles University Digital Repository.
Original record: http://hdl.handle.net/20.500.11956/35421

Permalink: http://www.nusl.cz/ntk/nusl-379578


The record appears in these collections:
Universities and colleges > Public universities > Charles University > Charles University Faculties (theses)
Academic theses (ETDs) > Master’s theses
 Record created 2018-06-28, last modified 2018-06-29


No fulltext
  • Export as DC, NUŠL, RIS
  • Share