Search
Now showing items 1-1 of 1
Výpočetní složitost problémů kombinatorické optimalizace pro specifické třídy grafů
Computational complexity of combinatorial problems in specific graph classes
rigorous thesis (RECOGNIZED)
Advisor: Fiala, Jiří
Date Issued: 2016
Date of defense: 08. 12. 2016
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: Tato diplomová práce se zabývá hranovou značkovatelností grafu v závislosti na parametrech p, q a λ. Pro parametry p = 2 a q = 1 jsme dokázali dichotomii. Tedy, že problém λ′ (2,1)-značkovatelnosti grafu je polynomiální ...
The topic of this diploma thesis is the edge distance labeling problem with specified parametres p, q and λ. We found a dychotomy for p = 2 and q = 1. So the problem is polynomial if λ ≤ 4 and it is NP-complete for λ > 4. ...
The topic of this diploma thesis is the edge distance labeling problem with specified parametres p, q and λ. We found a dychotomy for p = 2 and q = 1. So the problem is polynomial if λ ≤ 4 and it is NP-complete for λ > 4. ...