Algebraic graph theory for the formation of suboptimal cycle bases; an efficient force method

	Algebraic graph theory for the formation of suboptimal cycle bases; an efficient force method
Iranian Journal of Science and Technology Transactions of Civil Engineering
شناسنامه علمی شماره، دوره 28، شماره 5، خرداد 2004، صفحه 529-536
شناسه دیجیتال (DOI): 10.22099/ijstc.2013.1105
چکیده
An efficient algorithm is presented for the formation of suboptimal cycle bases of graphs corresponding to sparse cycle adjacency matrices, leading to the formation of highly sparse flexibility matrices. The algorithm presented employs concepts from the algebraic graph theory, together with a Greedy type algorithm to select cycles with small overlaps and uses a simple graph-theoretical method for controlling the independence of the selected cycles. Application of the present algorithm is extended to the formation of cycle bases corresponding to well conditioned flexibility matrices.
کلیدواژه‌ها
Force method؛ flexibility matrices؛ statical bases؛ sparsity؛ cycle bases؛ Graph Theory؛ suboptimal

آمار تعداد مشاهده مقاله: 1,404 تعداد دریافت فایل اصل مقاله: 9