Edge dominating set and colorings on graphs with fixed clique-width.

Daniel Kobler Udi Rotics

Published in: Discret. Appl. Math. (2003)

Keyphrases

dominating set
connected dominating set
facility location problem
weighted graph
undirected graph
independent set
maximum weight
maximum clique
fixed width
graph properties
graph matching
approximation algorithms
neural network
quasi cliques
graph theory
edge detection
complex networks
np hard