An efficient algorithm is presented for the formation of cycle bases of gra
phs corresponding to sparse cycle-member incidence matrices, leading to the
formation of highly sparse flexibility matrices. The algorithm presented e
mploys a new expansion process and uses an efficient graph-theoretical meth
od for controlling the independence of the selected cycles. (C) 1999 Civil-
Comp Ltd and Elsevier Science Ltd. All rights reserved.