Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 9 / 9
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
O razčlenitvah naravnih števil in nekaterih kombinatoričnih temah : zaključna naloga
Matic Požar, 2023, diplomsko delo

Ključne besede: množica, elementi, razčlenitev, bijekcija, indukcija, rekruzija
Objavljeno v RUP: 10.10.2023; Ogledov: 305; Prenosov: 3
.pdf Celotno besedilo (512,81 KB)

2.
3.
4.
5.
6.
Emotional contagion and mood in crowd serving as audience
Beno Arnejčič, 2015, izvirni znanstveni članek

Opis: 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.
Ključne besede: množica, čustva, vodje, javni govorniki, vedenje, občinstvo
Objavljeno v RUP: 15.10.2015; Ogledov: 2885; Prenosov: 399
URL Povezava na celotno besedilo

7.
8.
9.
The exact weighted independent set problem in perfect graphs and related classes
Martin Milanič, Jérôme Monnot, 2009, objavljeni znanstveni prispevek na konferenci

Opis: 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.
Ključne besede: graf, neodvisna množica, popolni graf, dvodelni graf
Objavljeno v RUP: 15.10.2013; Ogledov: 2766; Prenosov: 116
URL Povezava na celotno besedilo

Iskanje izvedeno v 0.05 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici