Lupa

Search the repository Help

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

Options:
  Reset


1 - 3 / 3
First pagePrevious page1Next pageLast page
1.
On the complexity of the vector connectivity problem
Ferdinando Cicalese, Martin Milanič, Romeo Rizzi, 2015, original scientific article

Found in: ključnih besedah
Summary of found: ...vector connectivity, APX-hardness, NP-hardness, polynomial-time algorithm, block graphs, ...
Keywords: vector connectivity, APX-hardness, NP-hardness, polynomial-time algorithm, block graphs
Published: 03.04.2017; Views: 630; Downloads: 22
URL Full text (0,00 KB)

2.
The minimum conflict-free row split problem revisited
Alexandru I. Tomescu, Romeo Rizzi, Martin Milanič, Edin Husić, Ademir Hujdurović, 2016, published scientific conference contribution

Found in: ključnih besedah
Summary of found: ...branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness...
Keywords: #the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness
Published: 14.11.2017; Views: 755; Downloads: 177
URL Full text (0,00 KB)
This document has more files! More...

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