Weighted Maximum-Clique Transversal Sets of Graphs
Author
Source
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-20, 20 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-01-26
Country of Publication
Egypt
No. of Pages
20
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Lee, Chuan-Min. 2012. Weighted Maximum-Clique Transversal Sets of Graphs. ISRN Discrete Mathematics،Vol. 2011, no. 2011, pp.1-20.
https://search.emarefa.net/detail/BIM-479932
Modern Language Association (MLA)
Lee, Chuan-Min. Weighted Maximum-Clique Transversal Sets of Graphs. ISRN Discrete Mathematics No. 2011 (2011), pp.1-20.
https://search.emarefa.net/detail/BIM-479932
American Medical Association (AMA)
Lee, Chuan-Min. Weighted Maximum-Clique Transversal Sets of Graphs. ISRN Discrete Mathematics. 2012. Vol. 2011, no. 2011, pp.1-20.
https://search.emarefa.net/detail/BIM-479932
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-479932
