| Article ID: | iaor200969259 |
| Country: | Romania |
| Volume: | 10 |
| Issue: | 1 |
| Start Page Number: | 121 |
| End Page Number: | 134 |
| Publication Date: | Jan 2008 |
| Journal: | Advanced Modeling and Optimization |
| Authors: | Pal Madhumangal, Das Kalyani |
| Keywords: | communication |
A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to find the maximum and the minimum height spanning trees on cactus graphs in O(n) time, 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.