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 a
Minimal cycle basis of graph products for the force method of frame analysis
β Scribed by Kaveh, A. ;Mirzaie, R.
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 249 KB
- Volume
- 24
- Category
- Article
- ISSN
- 1069-8299
- DOI
- 10.1002/cnm.979
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## 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
The modal superposition method is often used for computing the perturbation of eigenvectors in structural modification and model correction. However, it will bring about significant errors in the solution when the high-frequency modes are truncated. This paper presents a new method, which uses known
## Abstract Ergonomics has positive effects on both physical health and productivity, but estimating productivity benefits is difficult at the task design/redesign stage. Restβallowance prediction models are not suitable for repetitive, shortβcycle dynamic tasks, and methodsβtime measurement (MTM)