Weighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time.

Andreas Brandstädt Raffaele Mosca

Published in: CoRR (2015)

Keyphrases

special case
cost effective
graph model
weighted sum
database
case study
upper bound
lightweight
graph mining
graph theoretic
computationally tractable
bounded treewidth