Research Article
Weighted Maximum-Clique Transversal Sets of Graphs
Algorithm 1
Finding a maximum-clique transversal set of a split graph of minimum weight.
Input: A split graph . | Output: A maximum-clique transversal set of of minimum weight. | ββ(1) ; | ββ(2) for each vertex ββdo | ββ(3)β; | ββ(4) end for | ββ(5) for each vertex ββdo | ββ(6) βif β ββthen | ββ(7)βββ; | ββ(8) ββfor each ββdo | ββ(9) βββ; | (10) ββend for | (11) βend if | (12) end for | (13) Find a vertex such that ; | (14) Find a vertex such that ; | (15) Find a vertex such that ; | (16) if ββthen | (17) β; | (18) else | (19) β; | (20) end if | (21) Output the set ; |
|