SLO

Search the repository

A- | A+ | Print

Query:	search in
	search in
	search in
	search in
Work type:	* old and bologna study programme
Language:
Search in:
Options:	Show only hits with full text
	Reset

1 - 3 / 3

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: 4135; Downloads: 288
Link to full text

On hereditary efficiently dominatable graphs
Martin 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: 4713; Downloads: 275
Link to full text

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: 3381; Downloads: 215
Link to full text

Search done in 0 sec.