@Article{JICS-5-3,
author = {},
title = {An Optimal Algorithm to Find a Maximum Weight 2-Coloured Set on Cactus Graphs},
journal = {Journal of Information and Computing Science},
year = {2010},
volume = {5},
number = {3},
pages = {211--223},
abstract = { 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. 
},
issn = {1746-7659},
doi = {https://doi.org/2024-JICS-22712},
url = {https://global-sci.com/article/87444/an-optimal-algorithm-to-find-a-maximum-weight-2-coloured-set-on-cactus-graphs}
}