On the parameterized complexity of the multi-MCT and multi-MCST problems

DOI10.1007/S10878-009-9220-2MaRDI QIDQ630185zbMATH OpenOpenAlexWikidataFDO

Authors Wenbin Chen, Matthew C. Schmidt, Nagiza F. Samatova

Publication date 17 March 2011

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-009-9220-2

zbMATH Keywords

computational complexityW-hierarchy

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• On parameterized complexity of the multi-MCS problem
• scientific article; zbMATH DE number 1305085
• Analogs & duals of the MAST problem for sequences & trees
• Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees
• Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees

Cites work

• scientific article; zbMATH DE number 1003280 (Why is no real title available?)
• An algebraic view of the relation between largest common subtrees and smallest common supertrees
• Analogs & duals of the MAST problem for sequences & trees
• Finding largest subtrees and smallest supertrees
• On the approximation of largest common subtrees and largest common point sets
• The parameterized complexity of sequence alignment and consensus

Cited in

(2)

• On parameterized complexity of the multi-MCS problem
• Analogs & duals of the MAST problem for sequences & trees

This page was built for publication: On the parameterized complexity of the multi-MCT and multi-MCST problems

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