Minimal cycle basis of graph products for the force method of frame analysis
From MaRDI portal
Publication:3523987
DOI10.1002/cnm.979zbMath1159.70344OpenAlexW2003801558MaRDI QIDQ3523987
Publication date: 8 September 2008
Published in: Communications in Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cnm.979
graph productsforce methodlexicographicCartesianminimal cycle basissparse flexibility matricesstrong Cartesian
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Statics (70C20)
Cites Work
- Unnamed Item
- Suboptimal cycle bases of graphs for the flexibility analysis of skeletal structures
- Improved cycle bases for the flexibility analysis of structures
- Sparse self-stress matrices for the finite element force method
- On computational procedures for the force method
- On optimal cycle bases of graphs for mesh analysis of networks
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Revised Greedy algorithm for formation of a minimal cycle basis of a graph
- Cyclicity of graphs
- A unified method for eigendecomposition of graph products
- A Problem in Applied Topology: on the Selection of Cycles for the Flexibility Analysis of Skeletal Structures
This page was built for publication: Minimal cycle basis of graph products for the force method of frame analysis