Login / Signup

On the Parameterized Parallel Complexity and the Vertex Cover Problem.

Faisal N. Abu-KhzamShouwei LiChristine MarkarianFriedhelm Meyer auf der HeidePavel Podlipyan
Published in: COCOA (2016)
Keyphrases
  • vertex cover
  • approximation algorithms
  • planar graphs
  • worst case
  • optimality criterion
  • upper bound
  • space complexity
  • shared memory
  • parallel computing