An Optimal Algorithm to Find a Maximum Weight 2-Coloured Set on Cactus Graphs
Year: 2010
Journal of Information and Computing Science, Vol. 5 (2010), Iss. 3 : pp. 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.
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2024-JICS-22712
Journal of Information and Computing Science, Vol. 5 (2010), Iss. 3 : pp. 211–223
Published online: 2010-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 13