TL;DR
This paper introduces efficient linear-time algorithms for solving various graph theory problems on cactus graphs, which are applicable in real-world scenarios like radio communication systems.
Contribution
The paper develops optimal O(n) algorithms for multiple problems on cactus graphs, a class with practical applications in communication networks.
Findings
Algorithms run in linear time O(n).
Cactus graphs are useful in modeling communication systems.
The methods improve efficiency over previous approaches.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Vehicle Routing Optimization Methods · Complexity and Algorithms in Graphs