51. |
52. Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theoremAdemir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2018, original scientific article Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness Published in RUP: 08.05.2018; Views: 4128; Downloads: 162
Link to full text |
53. |
54. The minimum conflict-free row split problem revisitedAdemir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2016, published scientific conference contribution Keywords: #the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness Published in RUP: 14.11.2017; Views: 5075; Downloads: 287
Link to full text This document has more files! More... |
55. |
56. |
57. Set graphs. II. Complexity of set graph recognition and similar problemsMartin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2014, original scientific article Keywords: acyclic orientation, extensionality, set graphs, NP-complete problem, #P-complete problem, hyper-extensional digraphs, separating code, open-out-separating code Published in RUP: 03.04.2017; Views: 3711; Downloads: 136
Link to full text |
58. |
59. |
60. |