Cycle bases of graphs for sparse flexibi
β
A. Kaveh; G.R. Roosta
π
Article
π
1999
π
Elsevier Science
π
English
β 200 KB
An ecient algorithm is presented for the formation of cycle bases of graphs corresponding to sparse cyclemember incidence matrices, leading to the formation of highly sparse Β―exibility matrices. The algorithm presented employs a new expansion process and uses an ecient graph-theoretical method for c