Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 9
On the complexity of the vector connectivity problem
Ferdinando Cicalese, Martin Milanič, Romeo Rizzi
Izvirni znanstveni članek
Oznake: vector connectivity;APX-hardness;NP-hardness;polynomial-time algorithm;block graphs;
On the complexity of the vector connectivity problem
Leto: 2015 Vir: Univerza na Primorskem (UP)
Set graphs. II. Complexity of set graph recognition and similar problems
Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu
Izvirni znanstveni članek
Oznake: acyclic orientation;extensionality;set graphs;NP-complete problem;#P-complete problem;hyper-extensional digraphs;separating code;open-out-separating code;
Set graphs. II. Complexity of set graph recognition and similar problems
Leto: 2014 Vir: Univerza na Primorskem (UP)
ǂThe ǂminimum conflict-free row split problem revisited
Ademir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu
Objavljeni znanstveni prispevek na konferenci
Oznake: ǂthe ǂminimum conflict-free row split problem;branching;Dilworth's theorem;min-max theorem;approximation algorithm;APX-hardness;
The minimum conflict-free row split problem revisited
Leto: 2016 Vir: Univerza na Primorskem (UP)
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
Izvirni znanstveni članek
Oznake: perfect phylogeny;minimum conflict-free row split problem;branching;acyclic digraph;chain partition;Dilworth's theorem;min-max theorem;approximation algorithm;APXhardness;
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Leto: 2018 Vir: Univerza na Primorskem (UP)
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
Objavljeni povzetek znanstvenega prispevka na konferenci
Oznake: popolna filogenija;NP-težek problem;vejitev;acikličen digraf;particija na verige;Dilworthov izrek;min-maks izrek;aproksimacijski algoritem;hevristika;perfect phylogeny;NP-hard problem;branching;acyclic digraph;chain partition;Dilworth's theorem;min-max theorem;approximation algorithm;heuristic;
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Leto: 2018 Vir: Univerza na Primorskem (UP)
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
Objavljeni povzetek znanstvenega prispevka na konferenci
Oznake: perfect phylogeny;NP-hard problem;branching;acyclic digraph;chain partition;Dilworth's theorem;min-max theorem;approximation algorithm;heuristic;
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Leto: 2017 Vir: Univerza na Primorskem (UP)
Branchings in acyclic digraphs, a generalization of Dilworth's theorem, and an application to tumor sequencing
Ademir Hujdurović, Edin Husić, Xinyue Li, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu
Prispevek na konferenci brez natisa
Oznake: matematika;
Branchings in acyclic digraphs, a generalization of Dilworth's theorem, and an application to tumor sequencing
Leto: 2018 Vir: Univerza na Primorskem (UP)
Vector connectivity in graphs
Martin Milanič, Endre Boros, Ferdinando Cicalese, Pinar Heggernes, Pim Van 't Hof, Romeo Rizzi
Objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)
Oznake: 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;
Vector connectivity in graphs
Leto: 2014 Vir: Univerza na Primorskem (UP)
MIPUP
Edin Husić, Xinyue Li, Ademir Hujdurović, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanič, Alexandru I. Tomescu
Izvirni znanstveni članek
Oznake: perfect phylogeny;minimum conflict-free row split problem,;branching;acyclic digraph;integer linear programming;
MIPUP
Leto: 2019 Vir: Univerza na Primorskem (UP)
Št. zadetkov: 9
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: