Login
Lupa
First page / Search the repository

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 3 / 3
First pagePrevious page1Next pageLast page
1.
Particija grafa, odkrivanje skupnosti in maksimalen prerez : magistrsko delo
Peter 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: 3770; Downloads: 62
URL Link to full text

2.
Vector connectivity in graphs
Martin 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: 4958; Downloads: 316
URL Link to full text

3.
Vector connectivity in graphs
Martin Milanič, 2014, published scientific conference contribution abstract (invited lecture)

Keywords: vektorska povezanost, aproksimacijski algoritmi, polinomski algoritmi, NP-poln problem, razcepljeni grafi, kografi, drevesa
Published in RUP: 15.10.2015; Views: 4050; Downloads: 217
URL Link to full text
Search done in 1 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica