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 - 5 / 5
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: ...minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation...
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: 628; Downloads: 81
URL Full text (0,00 KB)

2.
MIPUP
Edin Husić, Xinyue Li, Ademir Hujdurović, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanič, Alexandru I. Tomescu, 2018, original scientific article

Found in: ključnih besedah
Summary of found: ...phylogeny, minimum conflict-free row split problem,, branching, acyclic digraph, integer linear programming...
Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, integer linear programming
Published: 17.09.2018; Views: 360; Downloads: 54
URL Full text (0,00 KB)

3.
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Martin Milanič, 2018, published scientific conference contribution abstract (invited lecture)

Found in: ključnih besedah
Summary of found: ...perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem,...
Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Published: 17.09.2018; Views: 256; Downloads: 5
URL Full text (0,00 KB)

4.
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Ademir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2018, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: ...perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem,...
Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Published: 17.09.2018; Views: 284; Downloads: 19
.pdf Full text (1,44 MB)
This document has more files! More...

5.
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Ademir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2017, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: ...perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation...
Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Published: 17.09.2018; Views: 340; Downloads: 56
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