Login / Signup

Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time.

Andreas BrandstädtElaine M. EschenErik Friese
Published in: WG (2015)
Keyphrases
  • special case
  • cost effective
  • computational complexity
  • database
  • real time
  • clustering algorithm
  • worst case
  • lightweight
  • computationally efficient
  • approximation algorithms