Lupa

Search the repository Help

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

Options:
  Reset


181 - 190 / 190
First pagePrevious page10111213141516171819Next pageLast page
181.
On the recognition of k-equistable graphs
Vadim E. Levit, Martin Milanič, D. Tankus, 2012, published scientific conference contribution

Keywords: maximal stable set, equistable graph, polynomial time algorithm
Published in RUP: 15.10.2013; Views: 2831; Downloads: 129
URL Link to full text

182.
183.
184.
Graph-theoretic concepts in computer science
2012, proceedings of peer-reviewed scientific conference contributions (international and foreign conferences)

Keywords: računalništvo, algoritmi, mednarodne konference
Published in RUP: 15.10.2013; Views: 3398; Downloads: 58
URL Link to full text

185.
Maximum (weight) stable sets are sometimes easy to find
Martin Milanič, 2005, invited lecture at foreign university

Published in RUP: 15.10.2013; Views: 2675; Downloads: 41
URL Link to full text

186.
Competitive evaluation of threshold functions and game trees in the priced information model
Martin Milanič, 2009, unpublished conference contribution

Published in RUP: 15.10.2013; Views: 2641; Downloads: 32
URL Link to full text

187.
Višina in oblikovanje cen rabljenih stanovanj v Sloveniji
Martin Romih, 2008, original scientific article

Keywords: hedonska analiza cen, trg stanovanj, cenovne razlike, Slovenija
Published in RUP: 15.10.2013; Views: 3089; Downloads: 96
.pdf Full text (142,63 KB)

188.
Simple and fast reoptimizations for the steiner tree problem
Bruno Escoffier, Martin Milanič, Vangelis Th. Paschos, 2009, original scientific article

Abstract: We address reoptimization issues for the Steiner tree problem. We assume that an optimal solution is given for some instance of the problem and the objective is to maintain a good solution when the instance is subject to minor modifications, the simplest such modifications being vertex insertions and deletions. We propose fast reoptimization strategies for the case of vertex insertions and we show that maintenance of a good solution for the 'shrunk' instance, without ex nihilo computation, is impossible when vertex deletions occur. We also provide lower bounds for the approximation ratios of the reoptimization strategies studied.
Keywords: reoptimizacija, Steinerjevo drevo, aproksimacijski algoritem
Published in RUP: 15.10.2013; Views: 2988; Downloads: 26
URL Link to full text

189.
On hereditary efficiently dominatable graphs
Martin Milanič, 2011, unpublished conference contribution

Keywords: perfect code, efficient domination, efficiently dominatable graph, polynomial time algorithm
Published in RUP: 15.10.2013; Views: 3122; Downloads: 67
URL Link to full text

190.
Graphs of small separability
Martin Milanič, 2010, invited lecture at foreign university

Published in RUP: 15.10.2013; Views: 2471; Downloads: 41
URL Link to full text

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica