A polynomial time algorithm for minimum weight cycles in twirl-wheel graphs
Decomposition results maybe used for the development of polynomial-time algorithms on well-structured classes of graphs to solve graph optimization problems that are NP-hard in general. Finding minimum-weight cycles in graphs is such a problem. In another paper, Coullard, Gardner, and Wagner proved the existence of a unique decomposition for 3-connected graphs. This paper contains two algorithms to compute the unique decomposition of a 3-connected graph and polynomial algorithms for finding minimum-weight cycles on the well-structured classes of wheels and twirls. The main focus of the paper is a recursive scheme to combine these algorithms to solve the minimum-weight cycle problem on graphs decomposable into members all of which are wheels and twirls.
- OSTI ID:
- 36051
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Increasing the weight of minimum spanning trees
Graph traversals, genes, and matroids: An efficient case of the travelling salesman problem