SLO

Login

First page / Search the repository

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

1

1.

Aproksimacijski vidiki vektorske dominacije in vektorske povezanosti v grah : zaključna naloga
Mirza Krbezlija, 2018, undergraduate thesis

Keywords: graph, vector domination, vector connectivity, submodular set covering problem, approximation algorithm, greedy heuristic, integer linear programming
Published in RUP: 17.09.2018; Views: 3165; Downloads: 48
Link to full text
This document has more files! More...

2.

On the complexity of the vector connectivity problem
Ferdinando Cicalese, Martin Milanič, Romeo Rizzi, 2015, original scientific article

Keywords: vector connectivity, APX-hardness, NP-hardness, polynomial-time algorithm, block graphs
Published in RUP: 03.04.2017; Views: 3275; Downloads: 62
Link to full text

3.

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: 4210; Downloads: 290
Link to full text

Search done in 0 sec.

Logos of partners