Výsledky vyhľadávania
Názov Perfect-matching covers of cubic graphs with colouring defect 3 Aut.údaje Ján Karabáš ... [et al.] Autor Karabáš Ján 1977- (25%) UMBFP05 - Katedra informatiky
Spoluautori Máčajová Edita (25%)
Nedela Roman 1960- (25%)
Ďalší autori Škoviera Martin (Autor) (25%)
Zdroj.dok. Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications : EUROCOMB’23. Pp. 639-646. - Brno : Masarykova univerzita v Brně, 2023 ; European Conference on Combinatorics, Graph Theory and Applications medzinárodná konferencia Kľúč.slová grafy - charts - graphs kubické grafy - cubic charts teória grafov - graph theory Form.deskr. príspevky v zborníku - proceedings papers Jazyk dok. angličtina Krajina Česká republika URL Link na plný text Kategória publikačnej činnosti AFC Číslo archívnej kópie 53352 Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xpca - PUBLIKAČNÁ ČINNOSŤ 
článok
Názov Decision trees in proper edge k-coloring of cubic graphs Aut.údaje Adam Dudáš, Bianka Modrovičová Autor Dudáš Adam 1992- (50%) UMBFP05 - Katedra informatiky
Spoluautori Modrovičová Bianka (50%)
Zdroj.dok. Proceedings of the 33rd Conference of Open Innovations Association FRUCT. Pp. 21-29. - [S.l.] : FRUCT Oy, 2023 ; Conference of Open Innovations Association FRUCT konferencia Kľúč.slová rozhodovacie stromy - decision trees umelá inteligencia - artificial intelligence strojové učenie - machine learning kubické grafy - cubic charts Form.deskr. príspevky v zborníku - proceedings papers Jazyk dok. angličtina Krajina Fínsko URL Link na zdrojový dokument Kategória publikačnej činnosti AFD Číslo archívnej kópie 53274 Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xpca - PUBLIKAČNÁ ČINNOSŤ článok
Názov Berge covers of cubic graphs with colouring defect 3 Aut.údaje Martin Škoviera ... [et al.] Autor Škoviera Martin (25%)
Spoluautori Karabáš Ján 1977- (25%) UMBFP05 - Katedra informatiky
Máčajová Edita (25%)
Nedela Roman 1960- (25%)
Zdroj.dok. BGTC 2023 : Belgian graph theory conference on structure and algorithms. Pp. 16. - Belgicko : Ghent University, 2023 ; Belgian Graph Theory Conference on Structure and Algorithms konferencia Kľúč.slová kubické grafy - cubic charts grafy - charts - graphs teória grafov - graph theory Form.deskr. abstrakty - abstracts Jazyk dok. angličtina Krajina Belgicko Kategória publikačnej činnosti GII Číslo archívnej kópie 53509 Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xpca - PUBLIKAČNÁ ČINNOSŤ článok
Názov Perfect matching index of cubic graphs with defect 3 Aut.údaje Ján Karabáš ... [et al.] Autor Karabáš Ján 1977- (25%)
Spoluautori Máčajová Edita (25%)
Nedela Roman 1960- (25%)
Škoviera Martin (25%)
Zdroj.dok. Booklet of abstracts for the 56th Czech-Slovak Conference on Graph Theory. Pp. 37. - Bratislava : Slovenská technická univerzita, 2021 ; Czech and Slovak Conference on Graph Theory 2021 konferencia Kľúč.slová grafy - charts - graphs kubické grafy - cubic charts Form.deskr. abstrakty - abstracts Jazyk dok. angličtina Krajina Slovenská republika URL Link na zdrojový dokument Kategória publikačnej činnosti AFH Číslo archívnej kópie 12483 Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xpca - PUBLIKAČNÁ ČINNOSŤ článok
Názov Cubic graphs of defect 3 Aut.údaje Ján Karabáš ... [et al.] Autor Karabáš Ján 1977- (25%)
Spoluautori Máčajová Edita (25%)
Nedela Roman 1960- (25%)
Škoviera Martin (25%)
Zdroj.dok. Booklet of abstracts for the 56th Czech-Slovak Conference on Graph Theory. Pp. 38. - Bratislava : Slovenská technická univerzita, 2021 ; Czech and Slovak Conference on Graph Theory 2021 konferencia Kľúč.slová grafy - charts - graphs kubické grafy - cubic charts Form.deskr. abstrakty - abstracts Jazyk dok. angličtina Krajina Slovenská republika URL Link na zdrojový dokument Kategória publikačnej činnosti AFH Číslo archívnej kópie 12543 Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xpca - PUBLIKAČNÁ ČINNOSŤ článok
Názov Algoritmy pre štrukturálnu analýzu kubických grafov Podnázov rigorózna práca Aut.údaje Jakub Strmeň; školiteľ: Ján Karabáš Autor Strmeň Jakub
Ďalší autori Karabáš Ján 1977- (Školiteľ (konzultant))
Korp. Univerzita Mateja Bela . Fakulta prírodných vied . Katedra informatiky , Banská Bystrica, Slovensko Vyd.údaje Banská Bystrica , 2021. - 70 s. Kľúč.slová kubické grafy - cubic charts algoritmy - algorithms počítačové algoritmy softwér snark Form.deskr. rigorózne práce - doctoral dissertations Jazyk dok. slovenčina Krajina Slovenská republika Systematika 004 Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xk - Kvalifikačné práce Počet ex. 1, z toho voľných 0, prezenčne 1 
kniha
Názov Optimization design for parallel coloring of a set of graphs in the High-Performance Computing Aut.údaje Adam Dudáš, Jarmila Škrinárová, Eduard Vesel Autor Dudáš Adam 1992- (40%)
Spoluautori Škrinárová Jarmila 1962- (40%) UMBFP05 - Katedra informatiky
Vesel Eduard (20%)
Zdroj.dok. IEEE 15th International Scientific Conference on Informatics : informatics 2019 : proceedings, 20.-22.11.2019, Poprad. Pp. 93-99. - New York : Institute of Electrical and Electronics Engineers, 2019 ; IEEE International Scientific Conference on Informatics Informatics 2019 Kľúč.slová paralelné počítanie - paralelné výpočty - parallel computing kubické grafy - cubic charts vysokovýkonné počítanie HPC algoritmy - algorithms informatika - informatics Form.deskr. príspevky v zborníku - proceedings papers Jazyk dok. angličtina Krajina Spojené štáty Anotácia © 2019 IEEE. This paper presents solution to problem of edge coloring of sizable set of cubic graphs and examination of relations between these graphs. We solved this problem on various computing systems and for various sizes of the problem (various number of graphs). For the computations we used High-Performance Computing Cluster and Amazon Web Services cloud environment. We measured and analyzed time of computation of edge coloring and other properties. Largest set we worked with contained almost 10 million graphs. We created new methodology, which can be used to finding order of the edges which optimizes time of computation of edge coloring for certain subset of graphs. On the basis of this methodology, we implemented algorithm for parallel edge coloring of set of graphs. For testing of the methodology, we designed 8 experiments. Results showed, that worst time of edge coloring of graph from set of 19 935 graphs before use of the methodology was 1260 ms. After application of our methodology, we found same order of edge coloring for whole group of 19 935 graphs and the highest time of coloring was 10 ms. Kategória publikačnej činnosti AFD Číslo archívnej kópie 47125 Kategória ohlasu CAILLOUET, Christelle - HEUSSE, Martin - ROUSSEAU, Franck. Optimal SF allocation in LoRaWAN considering physical capture and imperfect orthogonality. In EEE Global communications conference (GLOBECOM), Waikoloa, 09th-13th December 2019. New York : IEEE - Institute of electrical and electronics engineers, 2019. ISBN 978-1-7281-0962-6, pp. [1-8].
CERESNAK, Roman - KVET, Michal - MATIASKO, Karol. Improved method of selecting data in a nonrelational database. In 2021 international conference on information and digital technologies, IDT 2021, Žilina, 22th-24th June 2021. New Jersey : Institute of electrical and electronics engineers, 2021. ISBN 978-166543692-2, pp. 59-64.
KVET, Michal - ČEREŠŇÁK, Roman - ŠALGOVÁ, Veronika. Use of machine learning for the unknown values in database transformation processes. In 2021 Communication and information technologies conference proceedings, KIT 2021 : 11th international scientific conference, Vysoké Tatry, 13th-15th October 2021. New York : IEEE - Institute of electrical and electronics engineers, 2021. ISBN 978-1-6654-2879-8, pp. [1-7].
KVET, Michal. Covering undefined and untrusted values by the database index. In 10th world conference on information systems and technologies, WorldCIST 2022, Budva, 12th-14th April 2022. Berlin : Springer, 2022. ISBN 978-303104828-9, pp. 473-483.
KVET, Michal - MAJERCIAKOVA, Linda - GIBHARDT, Antoine - MILJKOVIC, Luka - BOUHTOUT, Wassim. Performance analysis of the database of telecommunications. In 31st conference of open innovations association, FRUCT 2022, virtual, 27th-29th April 2022. Helsinki : IEEE - Institute of electrical and electronics engineers, 2022. ISBN 978-952692447-2, pp. 145-152.
KVET, Michal. Identifying, managing, and accessing undefined tuple states in relational databases. In Proceedings of international conference on smart systems and technologies, SST 2022, Osijek, 19th-21st October. Piscataway : Institute of electrical and electronics engineers, 2022. ISBN 978-166548215-8, pp. 165-172.
KVET, Michal. Impact of disc types on database performance. In 16th international scientific conference on informatics : Informatics 2022, Poprad, 23th-25th November 2022. Piscataway : Institute of electrical and electronics engineers, 2022. ISBN 979-8-3503-1034-4, pp. 188-195.
KVET, Michal. Relation between the temporal database environment and disc block size. In 16th international scientific conference on informatics : Informatics 2022, Poprad, 23th-25th November 2022. Piscataway : Institute of electrical and electronics engineers, 2022. ISBN 979-8-3503-1034-4, pp. 196-202.
KVET, Michal. Identifying and treating NULL values in the Oracle Database performance case study. In 33rd Conference of Open innovations association : FRUCT 2023, Žilina, 24.05.-26.05.2023. Piscataway : Institute of electrical and electronics engineers computer society, 2023. ISBN 978-952692449-6, pp. 161-168.
KVET, Michal. Using boolean data type in Oracle database performance study. In International conference on information and digital technologies 2023 : IDT 2023, Žilina, 20th June 2023. Piscataway : Institute of electrical and electronics engineers, 2023. ISBN 979-835030586-9, pp. 179-186.
Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xpca - PUBLIKAČNÁ ČINNOSŤ 
nerozpoznaný
Názov Implementácia a meranie výkonnosti algoritmov pre regulárne hranové ofarbenia kubických grafov Podnázov diplomová práca Aut.údaje Tomáš Adamják; školiteľ: Ján Karabáš Autor Adamják Tomáš
Ďalší autori Karabáš Ján 1977- (Školiteľ (konzultant))
Korp. Univerzita Mateja Bela . Fakulta prírodných vied . Katedra informatiky , Banská Bystrica, Slovensko Vyd.údaje Banská Bystrica , 2017. - 105 s. Kľúč.slová kubické grafy - cubic charts algoritmy - algorithms Jazyk dok. slovenčina Krajina Slovenská republika Systematika 004 Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xk - Kvalifikačné práce Počet ex. 1, z toho voľných 0, prezenčne 1 kniha
Názov Atoms of cyclic connectivity in cubic graphs Súbež.n. Atómy cyklickej súvislosti v kubických grafoch Aut.údaje Roman Nedela, Martin Škoviera Autor Nedela Roman 1960-
Spoluautori Škoviera Martin
Zdroj.dok. Mathematica Slovaca. Vol. 45, no. 5 (1995), pp. 481-499. - Bratislava : Slovenská akadémia vied, Matematický ústav SAV, 1995 Kľúč.slová kubické grafy - cubic charts matematické štúdie Jazyk dok. angličtina Krajina Slovenská republika Systematika 519.1 Kategória publikačnej činnosti ADF Kategória ohlasu CAVICCHIOLI, A. - MESCHIARI, M. - RUINI, B. - SPAGGIARI, F. A survey on snarks and new results : products, reducibility and a computer search. In Journal of graph theory. ISSN 0364-9024, 1998, vol. 28, no. 2, pp. 57-86.
KOCHOL, M. Snarks without small cycles. In Journal of combinatiorial theory : series B. ISSN 0095-8956, 1996, vol. 67, no. 1, pp. 34-47.
LOU, Dingjun - LIANG, Kangqi. An improved algorithm for cyclic edge connectivity of regular graphs. In Ars combinatoria. ISSN 0381-7032, 2014, vol. 115, pp. 315-333.
ZHOU, Jin Xin - LI, Yan Tao. Super cyclically edge-connected vertex-transitive graphs of girth at least 5. In Acta Mathematica Sinica. ISSN 1439-8516, 2013, vol. 29, no. 8, pp. 1569-1580.
ZHOU, Jin Xin - FENG Yan Quan. Super-cyclically edge-connected regular graphs. In Journal of combinatorial optimization. ISSN 1382-6905, 2013, vol. 26, no. 2, pp. 393-411.
GLOVER, Henry H. - KUTNAR, Klavdija - MALNIC, Aleksander et al. Hamilton cycles in (2, odd, 3)-Cayley graphs. In Proceeding of the London mathematical society. ISSN 0024-6115, 2012, vol. 104, no. 6, pp. 1171-1197.
ZHANG, Zhao - WANG, Bing. cuper cyclically edge connected transitive graphs. In Journal of combinatorial optimization. ISSN 1382-6905, 2011, vol. 22, no. 4, pp. 549-562.
YU, Zhihua - LIU, Qinghai - ZHANG, Zhao. Cyclic vertex connectivity of star graphs. In Combinatorial optimization and applicaltions, part 1. Berlin : Springer, 2010. ISBN 978-3-642-17457-5, pp. 212-221.
GLOVER, Henry H. - KUTNAR, Klavdija - MARUSIC, Dragan. Hamiltonian cycles in cubic Cayley graphs : the (2, 4k, 3) case. In Journal of algebraic combinatorics. ISSN 0925-9899, 2009, vol. 30, no. 4, pp. 447-475.
KUTNAR, Klavdija - MARUSIC, Dragan. Hamilton cycles and paths in vertex-transitive graphs-current directions. In Disrete mathematics. ISSN 0012-365X, 2009, vol. 309, no. 17, pp. 5491-5500.
WANG, Bing - ZHANG, Zhao. On cyclic edge-connectivity of transitive graphs. In Discrete mathematics. ISSN 0012-365X, 2009, vol. 309, no. 13, pp. 4555-4563.
TIAN, Yingzhi - MENG Jixiang. Iambda(c)-optimally half vertex transitive graphs with regularity k. In Information processing letters. ISSN 0020-0190, 2009, vol. 109, no. 13, pp. 683-686.
ALDRED, Robert E.L. et al. Graph structural properties of non-Yutsis graphs allowing fast recognition. In Discrete applied mathematics. ISSN 0166-218X, 2009, vol. 157, no. 2, pp. 377-386.
LOU, Dingjun - WANG, Wei. Characterization of graphs with infinite cyclic edge connectivity. In Discrete mathematics. ISSN 0012-365X, 2008, vol. 308, no. 11, pp. 2094-2103.
KUTNAR, Klavdija - MARUSIC, Dragan. On cyclic edge-connectivity of fullerenes. In Discrete applied mathematics. ISSN 0166-218X, 2008, vol. 156, no. 10, pp. 1661-1669.
GLOVER, Henry H. - MARUSIC, Dragan. Hamiltonicity of cubic Cayley graphs. In Journal of the European mathematical society. ISSN 1435-9855, 2007, vol. 9, no. 4, pp. 775-787.
MACAJOVA, Edita - RASPAUD, Andre. On the strong circular 5-flow conjecture. In Journal of graph theory. ISSN 0364-9024, 2006, vol. 52, no. 4, pp. 307-316.
ZHANG, Z. - MENG, J.X. Serni-hyper-connected edge transitive graphs. In Discrete mathematics. ISSN 0012-365X, 2006, vol. 306, no. 7, pp. 705-710.
DVORAK, Z. - KARA, J. - KRAL, D. et al. An algorithm for cyclic edge connectivity of cubic graphs. In Algorithm theory - SWAT 2004 : 9th Scandinavian workshop on algorithm theory, Humlebeak. Berlin : Springer, 2004. ISBN 3-540-22339-8, pp. 236-247.
Katal.org. UKUMB###BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xpca - PUBLIKAČNÁ ČINNOSŤ Odkazy PERIODIKÁ-Súborný záznam periodika kniha