Cactus Graphs and Some Algorithms
Discrete Mathematics
2014-08-19 v1
Abstract
A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we consider several problems of graph theory and developed optimal algorithms to solve such problems on cactus graphs. The running time of these algorithms is O(n), where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, especially in radio communication system.
Keywords
Cite
@article{arxiv.1408.4005,
title = {Cactus Graphs and Some Algorithms},
author = {Kalyani Das},
journal= {arXiv preprint arXiv:1408.4005},
year = {2014}
}
Comments
15 pages