11. |
12. |
13. |
14. Particija grafa, odkrivanje skupnosti in maksimalen prerez : magistrsko deloPeter Muršič, 2012, master's thesis Keywords: particija grafa, odkrivanje skupnosti, algoritem Kernighan-Lin, maksimalen prerez, spektralna particija, modularnost, enostavna maksimizacija modularnosti, spektralna maksimizacija modularnosti, bisekcija grafa, hierarhično grozdenje, hevristike, aproksimacijski algoritmi, dendrogram Published in RUP: 13.11.2017; Views: 2218; Downloads: 51 Link to full text |
15. |
16. |
17. |
18. Vector connectivity in graphsMartin Milanič, Endre Boros, Ferdinando Cicalese, Pinar Heggernes, Pim Van 't Hof, Romeo Rizzi, 2014, published scientific conference contribution abstract (invited lecture) Keywords: vektorska povezanost, aproksimacijski algoritmi, polinomski algoritmi, NP-poln problem, razcepljeni grafi, kografi, drevesa, vector connectivity, approximation algorithms, poynomial time algorithms, NP-hard problem, split graphs, cographs, trees Published in RUP: 15.10.2015; Views: 3214; Downloads: 250 Link to full text |
19. On hereditary efficiently dominatable graphsMartin Milanič, 2011, published scientific conference contribution abstract Keywords: popolna koda, učinkovita dominacija, grafi z učinkovito dominantno množico, polinomski algoritmi, hereditarni grafovski razredi, perfect code, efficient domination, efficiently dominatable graphs, polynomial time algorithms, hereditary graph classes Published in RUP: 15.10.2015; Views: 3425; Downloads: 245 Link to full text |
20. |