An Optimal Algorithm to Find a Maximum Weight 2-Coloured Set on Cactus Graphs

Journal Home
Volume 19 - 2024
- Vol. 19, Issue 2 pp.81-190
- Vol. 19, Issue 1 pp.1-80
Volume 18 - 2023
- Vol. 18, Issue 2 pp.81-160
- Vol. 18, Issue 1 pp.1-80
Volume 17 - 2022
- Vol. 17, Issue 2 pp.83-160
- Vol. 17, Issue 1 pp.1-80
Volume 16 - 2021
- Vol. 16, Issue 2 pp.83-159
- Vol. 16, Issue 1 pp.1-80
Volume 15 - 2020
- Vol. 15, Issue 2 pp.83-160
- Vol. 15, Issue 1 pp.1-73
Volume 14 - 2019
- Vol. 14, Issue 4 pp.243-320
- Vol. 14, Issue 3 pp.163-240
- Vol. 14, Issue 2 pp.83-160
- Vol. 14, Issue 1 pp.1-80
Volume 13 - 2018
- Vol. 13, Issue 4 pp.243-320
- Vol. 13, Issue 3 pp.163-240
- Vol. 13, Issue 2 pp.83-160
- Vol. 13, Issue 1 pp.1-80
Volume 12 - 2017
- Vol. 12, Issue 4 pp.243-320
- Vol. 12, Issue 3 pp.163-240
- Vol. 12, Issue 2 pp.83-160
- Vol. 12, Issue 1 pp.1-80
Volume 11 - 2016
- Vol. 11, Issue 4 pp.243-320
- Vol. 11, Issue 3 pp.163-240
- Vol. 11, Issue 2 pp.83-160
- Vol. 11, Issue 1 pp.1-80
Volume 10 - 2015
- Vol. 10, Issue 4 pp.243-320
- Vol. 10, Issue 3 pp.163-240
- Vol. 10, Issue 2 pp.83-160
- Vol. 10, Issue 1 pp.1-80
Volume 9 - 2014
- Vol. 9, Issue 4 pp.243-320
- Vol. 9, Issue 3 pp.163-240
- Vol. 9, Issue 2 pp.83-153
- Vol. 9, Issue 1 pp.1-80
Volume 8 - 2013
- Vol. 8, Issue 4 pp.243-320
- Vol. 8, Issue 3 pp.163-240
- Vol. 8, Issue 2 pp.83-160
- Vol. 8, Issue 1 pp.1-80
Volume 7 - 2012
- Vol. 7, Issue 4 pp.243-320
- Vol. 7, Issue 3 pp.163-240
- Vol. 7, Issue 2 pp.83-160
- Vol. 7, Issue 1 pp.1-80
Volume 6 - 2011
- Vol. 6, Issue 4 pp.243-320
- Vol. 6, Issue 3 pp.163-240
- Vol. 6, Issue 2 pp.83-160
- Vol. 6, Issue 1 pp.1-80
Volume 5 - 2010
- Vol. 5, Issue 4 pp.243-320
- Vol. 5, Issue 3 pp.163-240
- Vol. 5, Issue 2 pp.83-160
- Vol. 5, Issue 1 pp.1-80
Volume 4 - 2009
- Vol. 4, Issue 4 pp.243-320
- Vol. 4, Issue 3 pp.161-239
- Vol. 4, Issue 2 pp.83-160
- Vol. 4, Issue 1 pp.1-80
Volume 3 - 2008
- Vol. 3, Issue 4 pp.243-268
- Vol. 3, Issue 3 pp.163-224
- Vol. 3, Issue 2 pp.83-152
- Vol. 3, Issue 1 pp.1-72
Volume 2 - 2007
- Vol. 2, Issue 4 pp.243-298
- Vol. 2, Issue 3 pp.163-240
- Vol. 2, Issue 2 pp.85-160
- Vol. 2, Issue 1 pp.1-80
Volume 1 - 2006
- Vol. 1, Issue 5 pp.259-317
- Vol. 1, Issue 4 pp.195-256
- Vol. 1, Issue 3 pp.129-192
- Vol. 1, Issue 2 pp.65-128
- Vol. 1, Issue 1 pp.1-64

Volume 5, Issue 3

Kalyani Das and Madhumangal Pal

J. Info. Comput. Sci. , 5 (2010), pp. 211-223.

[An open-access article; the PDF is free to any online user.]

Preview Full PDF 301 2423

Cited by

google scholar semantic scholar

Export citation

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.

Keywords

Design of algorithms, analysis of algorithms, 2-colour set, cactus graph.

AMS Subject Headings

Email address

BibTex
RIS
TXT

@Article{JICS-5-211, author = {Kalyani Das and Madhumangal Pal}, 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 = {3080-180X}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jics/22712.html} }

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 - 2010 DA - 2010/09 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.

Kalyani Das and Madhumangal Pal. (2010). An Optimal Algorithm to Find a Maximum Weight 2-Coloured Set on Cactus Graphs. Journal of Information and Computing Science. 5 (3). 211-223. doi:

Copy to clipboard

BibteX RIS TXT

The citation has been copied to your clipboard

- LOGIN -

- E-mail verification -

- REGISTER -