Zobrazeno 1 - 2
of 2
pro vyhledávání: '"udc:004:519.17"'
Publikováno v:
Symmetry
Volume 11
Issue 10
Symmetry, Vol 11, Iss 10, p 1300 (2019)
Symmetry, vol. 11, no. 10, 1300, 2019.
Volume 11
Issue 10
Symmetry, Vol 11, Iss 10, p 1300 (2019)
Symmetry, vol. 11, no. 10, 1300, 2019.
We introduce a new equivalence on graphs, defined by its symmetry-breaking capability. We first present a framework for various backtracking search algorithms, in which the equivalence is used to prune the search tree. Subsequently, we define the equ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa3e87d27b67a5a24c737da5ab739499
Autor:
Uršič Rutar, Mojca
V diplomski nalogi smo analizirali naloge z računalniškega tekmovanja Bober, ki se nanašajo na grafe. V prvem delu naloge smo opisali algoritme iz teorije grafov, ki jih pogosto uporabljamo v računalništvu. Nato smo pregledali naloge s tekmovanj
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3505::860d73800e0d09861d06d36e031a008b
https://repozitorij.uni-lj.si/IzpisGradiva.php?id=85740
https://repozitorij.uni-lj.si/IzpisGradiva.php?id=85740
