Show document

A- | A+ | Print
Title:Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Authors:Milanič, Martin (Author)
Work type:Unknown
Tipology:1.10 - Published Scientific Conference Contribution Abstract (invited lecture)
Organization:IAM - Andrej Marušič Institute
Keywords:perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Year of publishing:2018
Number of pages:Str. 1
COBISS_ID:1540564420 Link is opened in a new window
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 monograph

Title:IX Latin and American Algorithms, Graphs and Optimization Symposium, September 11-15, 2017, Marseille, France
Publisher:s. n.]
COBISS.SI-ID:1540556484 This link opens in a new window
Place of publishing:[S. l.
Year of publishing:2017


Leave comment

You have to log in to leave a comment.

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

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