Login / Signup

Weighted efficient domination for some classes of H-free and of (H1, H2)-free graphs.

Andreas BrandstädtVassilis GiakoumakisMartin Milanic
Published in: Discret. Appl. Math. (2018)
Keyphrases
  • cost effective
  • computationally expensive
  • databases
  • information retrieval
  • case study
  • graph theoretic
  • genetic algorithm
  • pairwise
  • weighted graph