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 - 1 / 1
First pagePrevious page1Next pageLast page
1.
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Ademir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2018, original scientific article

Found in: ključnih besedah
Summary of found: ...partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness...
Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness
Published: 08.05.2018; Views: 670; Downloads: 86
URL Full text (0,00 KB)

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