Sign in

Maximum common induced subgraph parameterized by vertex cover.

Faisal N. Abu-Khzam
Published in: Inf. Process. Lett. (2014)
Keyphrases
  • vertex cover
  • approximation algorithms
  • np hard
  • precedence constraints
  • partial order
  • planar graphs
  • scheduling problem
  • optimality criterion
  • closed form
  • single machine
  • gaussian process
  • minimum cost