ℹ️
🇬🇧
Search
Search for publications relevant for "složitost"
složitost
Publication
Class
Person
Publication
Programmes
On the computational complexity of partial covers of Theta graphs
Publication at Faculty of Mathematics and Physics
|
2005
2 people
Abstract
The paper considers the computational complexity of partial covers of Theta graphs
Keywords
computational
complexity
partial
covers
Theta
graphs
People
person
doc. RNDr. Jiří Fiala Ph.D.
Faculty of Mathematics and Physics
person
prof. RNDr. Jan Kratochvíl CSc.
Faculty of Mathematics and Physics