1. |
2. |
3. Demokracija nekoč, danes, jutri : magistrska nalogaZlatko Gombar, 2020, master's thesis Keywords: demokracija, ustavna demokracija, neposredna (klasična) demokracija, posredna (predstavniška) demokracija, e-demokracija, participativna demokracija, ljudstvo, elite, množica, drhal, čut za skupnost
Published in RUP: 20.11.2020; Views: 3178; Downloads: 164
 Full text (1,08 MB) |
4. Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphsDidem Gozüpek, Ademir Hujdurović, Martin Milanič, 2017, original scientific article Keywords: lekisikografski product grafov, minimalna dominantna množica, dobro dominiran graf, nesvodljiva dominantna množica, lexicographic product of graphs, minimal dominating set, well-dominated graph, irreducible dominating set
Published in RUP: 14.11.2017; Views: 2136; Downloads: 65
 Link to full text |
5. Novi koncepti in rezultati v teoriji dominacije in prirejanj v grafih : doktorska disertacijaNina Chiarelli, 2016, doctoral dissertation Keywords: hereditaren grafovski razred, pragoven graf, dominantno pragoven graf, totalno dominantna množica, povezana dominantna množica, hipergraf, ekvistabilen graf, ekvistarabilen graf, k-prirejanje, k-razširljivost, k-notranje razširljiv graf, kartezični produkt grafov
Published in RUP: 09.08.2016; Views: 3844; Downloads: 39
Link to full text |
6. Emotional contagion and mood in crowd serving as audienceBeno Arnejčič, 2015, original scientific article Abstract: The global world is gradually becoming a world of separated crowds despite the artificial wire and wireless connection through television and the Internet. Crowds remain a prevailing subject of research in different social studies, and the research of changes in the psychological structure of crowds and their characteristics is still of primary interest. The main focus of the research is on the interpretation of the results of the research paper about a special separated crowd called audience. It was observed how students, constituting the crowd, perceive a crowd on video. The observation was focused on the research of emotional contagion and mood in the crowd serving as audience. While watching a mass event on a big screen, the crowd serving as audience emotionally converges with someone else, in our case with public speakers.
Keywords: množica, čustva, vodje, javni govorniki, vedenje, občinstvo
Published in RUP: 15.10.2015; Views: 2946; Downloads: 400
Link to full text |
7. Linear separation of connected dominating sets in graphs : (extended abstract)Nina Chiarelli, Martin Milanič, 2014, published scientific conference contribution Keywords: povezana dominantna množica, hereditarni grafovski razred, dualno Spernerjev hipergraf, pragovni hipergraf, connected dominating set, hereditary graph class, dually Sperner hypergraph, treshold hypergraph
Published in RUP: 15.10.2015; Views: 3345; Downloads: 114
Link to full text |
8. |
9. The exact weighted independent set problem in perfect graphs and related classesMartin Milanič, Jérôme Monnot, 2009, published scientific conference contribution Abstract: The exact weighted independent set (EWIS) problem consists in determining whether a given vertex-weighted graph contains an independent set of given weight. This problem is a generalization of two well-known problems, the NP-complete subset sum problem and the strongly NP-hard maximum weight independent set (MWIS) problem. Since the MWIS problem is polynomially solvable for some special graph classes, it is interesting to determine the complexity of this more general EWIS problem for such graph classes. We focus on the class of perfect graphs, which is one of the most general graph classes where the MWIS problem can be solved in polynomial time. It turns out that for certain subclasses of perfect graphs, the EWIS problem is solvable in pseudopolynomial time, while on some others it remains strongly NP-complete.In particular, we show that the EWIS problem is strongly NP-complete for bipartite graphs of maximum degree three, but solvable in pseudo-polynomial time for cographs, interval graphs and chordal graphs, as well as for some other related graph classes.
Keywords: graf, neodvisna množica, popolni graf, dvodelni graf
Published in RUP: 15.10.2013; Views: 2879; Downloads: 116
Link to full text |
