๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Subminimal cycle basis of a graph for efficient force method of frame analysis

โœ Scribed by Kaveh, A. ;Moez, H.

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
135 KB
Volume
21
Category
Article
ISSN
1069-8299

No coin nor oath required. For personal study only.

โœฆ Synopsis

A new method is presented for the formation of subminimal cycle bases of graphs corresponding to sparse exibility matrices. In this approach, a contraction method is used, leading to the reduction of the size of the graph at each step. This reduction facilitates the selection of the smallest cycle at subsequent steps.

๐Ÿ“œ SIMILAR VOLUMES

Revised Greedy algorithm for formation o
Revised Greedy algorithm for formation of a minimal cycle basis of a graph
โœ Kaveh, A. ;Roosta, G. R. ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 356 KB ๐Ÿ‘ 1 views

## SUM MARY An efficient algorithm is developed for the formation of a minimal cycle basis of a graph. This method reduces the number of cycles to be considered as (candidates for being the elements of a minimal basis and makes practical use of the Greedy algorithm feasible. A comparison is made b