Algebraic graph theory for the formation of suboptimal cycle bases; an efficient force method
Editorial
10.22099/ijstc.2013.1105
Abstract
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.
(2013). 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), 529-536. doi: 10.22099/ijstc.2013.1105
MLA
. "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, 2013, 529-536. doi: 10.22099/ijstc.2013.1105
HARVARD
(2013). '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), pp. 529-536. doi: 10.22099/ijstc.2013.1105
VANCOUVER
Algebraic graph theory for the formation of suboptimal cycle bases; an efficient force method. Iranian Journal of Science and Technology Transactions of Civil Engineering, 2013; 28(5): 529-536. doi: 10.22099/ijstc.2013.1105
)