Revised Greedy algorithm for formation of a minimal cycle basis of a graph

DOI10.1002/cnm.1640100704zbMath0805.05077OpenAlexW2121490490MaRDI QIDQ4306913

G. R. Roosta, Ali Kaveh

Publication date: 22 September 1994

Published in: Communications in Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cnm.1640100704

zbMATH Keywords

greedy algorithmcycle basisshortest route tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Minimal cycle basis of graph products for the force method of frame analysis ⋮ Subminimal cycle basis of a graph for efficient force method of frame analysis ⋮ Suboptimal cycle bases for the force method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combinatorial optimization problem: optimal generalized cycle bases
• Improved cycle bases for the flexibility analysis of structures
• Note on Independence Functions
• An efficient flexibility analysis of structures
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• An efficient program for generating subminimal cycle bases for the flexibility analysis of structures
• Cycle bases of minimal measure for the structural analysis of skeletal structures by the flexibility method
• Subminimal cycle bases for the force method of structural analysis
• On the Abstract Properties of Linear Dependence
• Matroids and the greedy algorithm