Search results
Title Interpretable random forest model for identification of edge 3-uncolorable cubic graphs Author info Adam Dudáš, Bianka Modrovičová Author Dudáš Adam 1992- (70%) UMBFP05 - Katedra informatiky
Co-authors Modrovičová Bianka (30%)
Source document Kybernetika. Roč. 59, č. 6 (2023), s. 807-826. - Praha : Akademie věd České republiky, 2023 Keywords náhodné lesy - náhodný les - random forests ofarbovanie grafov - graph coloring učenie - učenie sa - learning snark Form. Descr. články - journal articles Language English Country Czech Republic URL Link na zdrojový dokument Public work category ADC No. of Archival Copy 54284 Catal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Database xpca - PUBLIKAČNÁ ČINNOSŤ References PERIODIKÁ-Súborný záznam periodika 
article
Title Girth, oddness, and colouring defect of snarks Author info Ján Karabáš, Edita Máčajová ... [et al.] Author Karabáš Ján 1977- (25%) UMBFP05 - Katedra informatiky
Co-authors Máčajová Edita (25%)
Nedela Roman 1960- (25%)
Škoviera Martin (25%)
Source document Discrete Mathematics. Vol. 345, no. 11 (2022), pp. [1-10]. - Amsterdam : Elsevier B.V., 2022 Keywords snark grafy - charts - graphs Form. Descr. články - journal articles Language English Country Netherlands URL Link na plný text Public work category ADM No. of Archival Copy 52279 Catal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Database xpca - PUBLIKAČNÁ ČINNOSŤ References PERIODIKÁ-Súborný záznam periodika article
Title Optimization of the functional decomposition of parallel and distributed computations in graph coloring with the use of high-performance computing Author info Jarmila Škrinárová, Adam Dudáš Author Škrinárová Jarmila 1962- (50%) UMBFP05 - Katedra informatiky
Co-authors Dudáš Adam 1992- (50%) UMBFP05 - Katedra informatiky
Source document IEEE Access. Vol. 10 (2022), pp. 34996-35011. - Piscataway : Institute of Electrical and Electronics Engineers, 2022 Keywords dekompozícia distribuované počítanie - distributed computing paralelné počítanie - paralelné výpočty - parallel computing snark Form. Descr. články - journal articles Language English Country United States of America URL Link na plný text Public work category ADC No. of Archival Copy 51611 Repercussion category KUBOVČÍK, Martin - DIRGOVÁ LUPTÁKOVÁ, Iveta - POSPÍCHAL, Jiří. Signal novelty detection as an intrinsic reward for robotics. In Sensors. ISSN 1424-8220, 2023, vol. 23, no. 8, pp. 1-17.
HURAJ, Ladislav - HRINKINO, Dominik - SIMON, Marek. Performance of DNS over HTTPS implementation on low-power devices. In 12th computer science online conference : CSOC 2023, online, 03rd-05th April 2023. Berlin : Springer science and business media, 2023. ISBN 978-303135316-1, pp. 415-425.
Catal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Database xpca - PUBLIKAČNÁ ČINNOSŤ References PERIODIKÁ-Súborný záznam periodika article
Title Algoritmy pre štrukturálnu analýzu kubických grafov Subtitle rigorózna práca Author info Jakub Strmeň; školiteľ: Ján Karabáš Author Strmeň Jakub
Another authors Karabáš Ján 1977- (Školiteľ (konzultant))
Corporation Univerzita Mateja Bela . Fakulta prírodných vied . Katedra informatiky , Banská Bystrica, Slovensko Issue data Banská Bystrica , 2021. - 70 s. Keywords kubické grafy - cubic charts algoritmy - algorithms počítačové algoritmy softwér snark Form. Descr. rigorózne práce - doctoral dissertations Language Slovak Country Slovak Republic systematics 004 Catal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Database xk - Kvalifikačné práce Copy count 1, currently available 0, at library only 1 
book
Title 6-decomposition of snarks Author info Ján Karabáš, Edita Máčajová, Roman Nedela Author Karabáš Ján 1977- (34%) UMBFP12 - Inštitút matematiky a informatiky
Co-authors Máčajová Edita (33%)
Nedela Roman 1960- (33%) UMBFP10 - Katedra matematiky
Source document European Journal of Combinatorics. Vol. 34, no. 1 (2013), pp. 111-122. - London : Academic Press, 2013 Keywords matematika - mathematics snark 6-decomposition Language English systematics 51 Annotation A snark is a cubic graph with no proper $3$-edge-colouring. In 1996, Nedela and /v Skoviera proved the following theorem: Let G be a snark with an k-edge-cut, k>= 2, whose removal leaves two 3-edge-colourable components M and N. Then both M and N can be completed to two snarks $/tilde M$ and $/tilde N$ of order not exceeding that of G by adding at most $/kappa(k)$ vertices, where the number $/kappa(k)$ only depends on $k$. The known values of the function $/kappa(k)$ are $/kappa(2)=0$, $/kappa(3)=1$, $/kappa(4)=2$ (Goldberg, 1981), and $/kappa(5)=5$ (Cameron, Chetwynd, Watkins, 1987). The value $/kappa(6)$ is not known and is apparently difficult to calculate. In 1979, Jaeger conjectured that there are no 7-cyclically-connected snarks. If this conjecture holds true, then $/kappa(6)$ is the last important value to determine. The paper is aimed attacking the problem of determining $/kappa(6)$ by investigating the structure and colour properties of potential complements in $6$-decompositions of snarks. We find a set of $14$ complements that suffice to perform $6$-decompositions of snarks with at most $30$ vertices. We show that if this set is not complete to perform $6$-decompositions of all snarks, then $/kappa(6)/geq 20$ and there are strong restrictions on the structure of (possibly) missing complements. Public work category AFC No. of Archival Copy 25350 Repercussion category FIOL, M.A. - MAZZUOCCOLO, G. - STEFFEN, E. On measures of edge-uncolorability of cubic graphs : a brief survey and some new results. In arXiv:1702.07156 [math.CO] [online]. New York : Cornell Univerisity Library, 2017, [1-39][cit. 2018-22-02]. Dostupné na: https://arxiv.org/pdf/1702.07156.pdf
FIOL, M. A. - VILALTELLA, J. Some results on the structure of multipoles in the study of snarks. In Electronic journal of combinatorics. ISSN 1077-8926, 2015, vol. 22, no. 1.
FIOL, M. A. - MAZZUOCCOLO, G. - STEFFEN, E. Measures of edge-uncolorability of cubic graphs. In Electronic journal of combinatorics. ISSN 1077-8926, 2018, vol. 25, no. 4.
OZEKI, Kenta. Kempe equivalence classes of cubic graphs embedded on the projective plane. In Combinatorica. ISSN 0209-9683, 2022, vol. 42, no. 2, pp. 1451-1480.
MAZAK, Jan - RAJNIK, Jozef - SKOVIERA, Martin. Morphology of small snarks. In Electronic journal of combinatorics. ISSN 1077-8926, 2022, vol. 29, no. 4, pp. 1-46.
SKRINAROVA, Jarmila - DUDAS, Adam. Optimization of the functional decomposition of parallel and distributed computations in graph coloring with the use of high-performance computing. In IEEE access. ISSN 2169-3536, 2022, vol. 10, pp. 34996-35011.
DUDÁŠ, Adam - ŠKRINÁROVÁ, Jarmila - KISS, Adam. On graph coloring analysis through visualization. In Information and digital technologies 2021 : proceedings of the international conference, Žilina, 22.-24.06.2021. 1. vyd. Danvers : Institute of electrical and electronics engineers, 2021. ISBN 978-1-6654-3692-2, pp. 71-78.
Catal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Database xpca - PUBLIKAČNÁ ČINNOSŤ References PERIODIKÁ-Súborný záznam periodika 
unrecognised