TY - JOUR
A2 - PĂȘcher, A.
A2 - Tomita, E.
A2 - Cheng, E.
AU - Lee, Chuan-Min
PY - 2011
DA - 2012/01/26
TI - Weighted Maximum-Clique Transversal Sets of Graphs
SP - 540834
VL - 2011
AB - A maximum-clique transversal set of a graph G is a subset of vertices intersecting all maximum cliques of G. The maximum-clique transversal set problem is to find a maximum-clique transversal set of G of minimum cardinality. Motivated by the placement of transmitters for cellular telephones, Chang, Kloks, and Lee introduced the concept of maximum-clique transversal sets on graphs in 2001. In this paper, we study the weighted version of the maximum-clique transversal set problem for split graphs, balanced graphs, strongly chordal graph, Helly circular-arc graphs, comparability graphs, distance-hereditary graphs, and graphs of bounded treewidth.
SN - xxxx-xxxx
UR - https://doi.org/10.5402/2011/540834
DO - 10.5402/2011/540834
JF - ISRN Discrete Mathematics
PB - International Scholarly Research Network
KW -
ER -