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.
A complexitystudy of distance variants of covering and domination problems in H-free graphs : master's thesis
Mirza Krbezlija, 2021, master's thesis

Keywords: distance-k dominating set, distance-k edge dominating set, distance-k vertex cover, distance k-edge cover, H-free graph, polynomial-time algorithm, NP-complete problem, dichotomy theorem
Published in RUP: 18.10.2021; Views: 5645; Downloads: 27
URL Link to full text

2.
Vertex cover at distance on H-free graphs
Clément Jean Dallard, Mirza Krbezlija, Martin Milanič, 2021, published scientific conference contribution

Keywords: distance-k vertex cover, H-free graph, np-completeness, polynomial-time algorithm, dichotomy
Published in RUP: 16.07.2021; Views: 5108; Downloads: 39
URL Link to full text

3.
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: 5303; Downloads: 56
URL Link to full text
This document has more files! More...
Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica