Michael R. Fellows
Abstract
Open-access reader
Min Cut Linear Arrangement, Independet Set, Vertex Cover and Dominating Set.The last two problems are de ned
OpenAlex reports 2911 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Min Cut Linear Arrangement, Independet Set, Vertex Cover and Dominating Set.The last two problems are de ned
Key concepts: Parameterized complexity, Computer science, Theoretical computer science, Algorithmic complexity, Programming language, Algorithm