11. 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: 3231; Downloads: 250
 Link to full text |
12. 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: 3447; Downloads: 245
Link to full text |
13. Essentials of metaheuristics : a set of undergraduate lecture notesSean Luke, 2009 Keywords: matematična optimizacija, operacijsko raziskovanje, paralelni algoritmi, genetski algoritmi, metahevristika, mathematical optimization, parallel algorithms, operations research, metaheuristics, parallelism
Published in RUP: 10.07.2015; Views: 3425; Downloads: 38
Link to full text |
14. |
15. |
16. |
