1. Linear colorings of graphsClaire Hilaire, Matjaž Krnc, Martin Milanič, Jean-Florent Raymond, 2026, izvirni znanstveni članek Opis: Motivated by algorithmic applications, Kun, O’Brien, Pilipczuk, and Sullivan introduced the parameter linear chromatic number as a relaxation of treedepth and proved that the two parameters are polynomially related. They conjectured that treedepth could be bounded from above by twice the linear chromatic number. In this paper we investigate the properties of linear chromatic number and provide improved bounds in several graph classes.
Ključne besede: linear coloring, central coloring, treedepth
Objavljeno v RUP: 25.03.2026; Ogledov: 324; Prenosov: 3
 Celotno besedilo (713,67 KB)
Gradivo ima več datotek! Več... |
2. |
3. |
4. |
5. Proceedings of the 2019 6th Student Computer Science Research Conference - StuCoSReC2019, zbornik recenziranih znanstvenih prispevkov na mednarodni ali tuji konferenci Opis: Computer science is now among the most popular study programmes worldwide. We live in a digital age where most industries rely on data and software programmes. From transport infrastructure to public health systems, banking and communications, computer science is everywhere. Technology has made the world better, faster, and more connected. However, it is easy to miss an important component of this exciting success story. Such development was made possible thanks to the brilliant minds of IT graduates, who took their passion for technology and used it to create ground breaking gadgets and computer programmes. Here in Slovenia, the three public universities share these values and invest heavily in their computer science students. These efforts facilitate collaboration among our departments, resulting in joint events such as this StuCoSRec student conference.
Ključne besede: algoritmi, podatkovne strukture, podatkovne baze, informatika
Objavljeno v RUP: 07.11.2021; Ogledov: 2788; Prenosov: 62
Celotno besedilo (12,98 MB) |
6. The recognition problem of graph search trees read moreJesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Pivač, Robert Scheffler, Martin Strehler, 2021, izvirni znanstveni članek Ključne besede: search tree recognition, LBFS, LDFS, MNS, MCS, chordal graphs
Objavljeno v RUP: 18.10.2021; Ogledov: 4243; Prenosov: 33
 Povezava na celotno besedilo |
7. |
8. |
9. |
10. Edge elimination and weighted graph classesJesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaž Krnc, Martin Milanič, Nevena Pivač, Robert Scheffler, Martin Strehler, 2020, objavljeni znanstveni prispevek na konferenci Ključne besede: edge elimination, weighted graph, split graph, threshold graph, chain graph, linear-time recognition algorithm
Objavljeno v RUP: 10.11.2020; Ogledov: 3421; Prenosov: 39
Povezava na celotno besedilo |
