Computational Technology Resources - CCP

Paper I.2

Cycle Bases of Graphs for Sparse Flexibility Matrices

A. Kaveh* and G.R. Roosta#

*Iran University of Science and Technology, Tehran, Iran
#Building and Housing Research Centre, Tehran, Iran

doi:10.4203/ccp.43.1.2

A. Kaveh, G.R. Roosta, "Cycle Bases of Graphs for Sparse Flexibility Matrices", in B.H.V. Topping, (Editor), "Advances in Computational Techniques for Structural Engineering", Civil-Comp Press, Edinburgh, UK, pp 7-11, 1996. doi:10.4203/ccp.43.1.2

Abstract

An efficient algorithm is presented for the formation of cycle bases of graphs corresponding to sparse cycle-member incidence matrices, leading to the formation of highly sparse flexibility matrices. The algorithm presented employs a new expansion process and uses an efficient graph-theoretical method for controlling the independence of the selected cycles.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £68 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 43 ADVANCES IN COMPUTATIONAL TECHNIQUES FOR STRUCTURAL ENGINEERING Edited by: B.H.V. Topping Paper I.2 Cycle Bases of Graphs for Sparse Flexibility Matrices A. Kaveh* and G.R. Roosta# *Iran University of Science and Technology, Tehran, Iran #Building and Housing Research Centre, Tehran, Iran doi:10.4203/ccp.43.1.2 purchase the full-text of this paper Full Bibliographic Reference for this paper A. Kaveh, G.R. Roosta, "Cycle Bases of Graphs for Sparse Flexibility Matrices", in B.H.V. Topping, (Editor), "Advances in Computational Techniques for Structural Engineering", Civil-Comp Press, Edinburgh, UK, pp 7-11, 1996. doi:10.4203/ccp.43.1.2 Abstract An efficient algorithm is presented for the formation of cycle bases of graphs corresponding to sparse cycle-member incidence matrices, leading to the formation of highly sparse flexibility matrices. The algorithm presented employs a new expansion process and uses an efficient graph-theoretical method for controlling the independence of the selected cycles. purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £68 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions