On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs
From MaRDI portal
Publication:3575242
DOI10.1007/978-3-642-13509-5_12zbMath1286.68235OpenAlexW1689849645MaRDI QIDQ3575242
Publication date: 26 July 2010
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13509-5_12
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
On the parameterized complexity of some optimization problems related to multiple-interval graphs ⋮ Tractability and Approximability of Maximal Strip Recovery ⋮ The maximum clique problem in multiple interval graphs
This page was built for publication: On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs
