1. |
2. User needs and perspectives on technologies or healthy ageingMateja Erce, Rok Ovsenik, Dean Lipovac, Michael David Burnard, 2021, objavljeni povzetek znanstvenega prispevka na konferenci Ključne besede: older adults, building solutions, technology acceptance, well-being, independence Objavljeno v RUP: 24.06.2021; Ogledov: 980; Prenosov: 50 Celotno besedilo (1,75 MB) Gradivo ima več datotek! Več... |
3. Mind the independence gapTinaz Ekim, Didem Gozüpek, Ademir Hujdurović, Martin Milanič, 2020, izvirni znanstveni članek Ključne besede: maximal independent set, independent dominating set, well-covered graph, hereditary independence gap, polynomial-time algorithm, NP-hard problem Objavljeno v RUP: 19.05.2020; Ogledov: 1653; Prenosov: 57 Povezava na celotno besedilo |
4. |
5. |
6. Coding theory and applications, solved exercises and problems of linear codesEnes Pašalić, 2013, drugo učno gradivo Ključne besede: Gilbert-Eliot channel model, linear code, linear block code, code design, undetected error probability, linear independence, standard form, codeword weight, code rate, systematic code, Binary Hamming code Objavljeno v RUP: 15.10.2013; Ogledov: 5396; Prenosov: 95 Povezava na celotno besedilo |
7. |
8. A note on domination and independence-domination numbers of graphsMartin Milanič, 2013, objavljeni znanstveni prispevek na konferenci Opis: Vizing's conjecture is true for graphs ▫$G$▫ satisfying ▫$\gamma^i(G) = \gamma(G)$▫, where ▫$\gamma(G)$▫ is the domination number of a graph ▫$G$▫ and ▫$\gamma^i(G)$▫ is the independence-domination number of ▫$G$▫, that is, the maximum, over all independent sets ▫$I$▫ in ▫$G$▫, of the minimum number of vertices needed to dominate ▫$I$▫. The equality ▫$\gamma^i(G) = \gamma(G)$▫ is known to hold for all chordal graphs and for chordless cycles of length ▫$0 \pmod{3}$▫. We prove some results related to graphs for which the above equality holds. More specifically, we show that the problems of determining whether ▫$\gamma^i(G) = \gamma(G) = 2$▫ and of verifying whether ▫$\gamma^i(G) \ge 2$▫ are NP-complete, even if ▫$G$▫ is weakly chordal. We also initiate the study of the equality ▫$\gamma^i = \gamma$▫ in the context of hereditary graph classes and exhibit two infinite families of graphs for which ▫$\gamma^i < \gamma$▫. Ključne besede: Vizing's conjecture, domination number, independence-domination number, weakly chordal graph, NP-completeness, hereditary graph class, IDD-perfect graph Objavljeno v RUP: 15.10.2013; Ogledov: 3113; Prenosov: 128 Celotno besedilo (300,57 KB) |
9. |