Lupa

Show document

A- | A+ | Print
Title:Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Authors:Hujdurović, Ademir (Author)
Husić, Edin (Author)
Milanič, Martin (Author)
Rizzi, Romeo (Author)
Tomescu, Alexandru I. (Author)
Files:URL https://doi.org/10.1145/3182178
 
Language:English
Work type:Unknown
Tipology:1.01 - Original Scientific Article
Organization:IAM - Andrej Marušič Institute
Keywords:perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness
Year of publishing:2018
Number of pages:Article 20 (26 str.)
Numbering:#no. #2, #Vol. #14
UDC:519.17
ISSN on article:1549-6325
COBISS_ID:1540282052 Link is opened in a new window
DOI:10.1145/3182178 Link is opened in a new window
Views:628
Downloads:80
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:Document is not linked to any category.
:
  
Average score:(0 votes)
Your score:Voting is allowed only to logged in users.
Share:Bookmark and Share

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:ACM transactions on algorithms
Publisher:Association for Computing Machinery
ISSN:1549-6325
COBISS.SI-ID:14508889 This link opens in a new window

Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica