Parameterized and Exact Computation

DOI10.1007/B100584MaRDI QIDQ5311503zbMATH OpenOpenAlexFDO

Authors Peter Damaschke

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100584

zbMATH Keywords

enumerationparameterized complexityperfect phylogenytransversalvertex cover

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problems related to evolution (92D15)

Recommendations

• Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
• A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
• A Polynomial-Time Algorithm for Near-Perfect Phylogeny
• Paradigms for parameterized enumeration
• Publication:4886095

Cited in

(8)

• An impossibility result for phylogeny reconstruction from \(k\)-mer counts
• Paradigms for parameterized enumeration
• Performance of matrix representation with parsimony for inferring species from gene trees
• scientific article; zbMATH DE number 2090012 (Why is no real title available?)
• Enumerating Minimal Dominating Sets in Triangle-Free Graphs
• An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set
• Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
• Computational aspects of monotone dualization: a brief survey

This page was built for publication: Parameterized and Exact Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311503)