TY - JOUR
T1 - An Optimal Algorithm to Find a Maximum Weight 2-Coloured Set on Cactus Graphs
AU - Kalyani Das and Madhumangal Pal
JO - Journal of Information and Computing Science
VL - 3
SP - 211
EP - 223
PY - 2024
DA - 2024/01
SN - 5
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22712.html
KW -  Design of algorithms, analysis of algorithms, 2-colour set, cactus graph. 

AB -  A  cactus  graph  is  a  connected  graph  in  which  every  block  is  either  an  edge  or  a  cycle.  An 
)(nO  time, 
optimal algorithm is presented here to find a maximum weight 2-coloured set on cactus graphs in 
where  n  is  the  total  number  of  vertices  of  the  graph.  The  cactus  graph  has  many  applications  in  real  life 
problems, specially in radio communication system.