On parameterized complexity of the multi-MCS problem
DOI10.1016/J.TCS.2008.12.060zbMATH Open1168.68018OpenAlexW2079592951MaRDI QIDQ1019178FDOQ1019178
Matthew C. Schmidt, Wenbin Chen, Nagiza F. Samatova
Publication date: 28 May 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.060
Recommendations
- On the parameterized complexity of the multi-MCT and multi-MCST problems
- On the average-case complexity of MCSP and its variants
- On the parameterized complexity of multiple-interval graph problems
- Complexity and approximability of parameterized MAX-CSPs
- Complexity and Approximability of Parameterized MAX-CSPs
- On the parameterized complexity of some optimization problems related to multiple-interval graphs
- On the parameterized complexity of some optimization problems related to multiple-interval graphs
- scientific article; zbMATH DE number 1748022
- The Parameterized Complexity of Maximality and Minimality Problems
- The parameterized complexity of maximality and minimality problems
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- On the approximability of the maximum common subgraph problem
- The parameterized complexity of sequence alignment and consensus
- Describing parameterized complexity classes
Cited In (3)
This page was built for publication: On parameterized complexity of the multi-MCS problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019178)
