On optimal cycle bases of graphs for mesh analysis of networks

DOI10.1002/NET.3230190302zbMATH Open0704.90097OpenAlexW2092181493MaRDI QIDQ3484660FDOQ3484660

Authors: A. Kaveh 

Publication date: 1989

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230190302

Recommendations

• Minimum cycle bases for network graphs
• scientific article; zbMATH DE number 4126612
• An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
• Minimum cycle bases, faster and simpler
• Suboptimal cycle bases for the force method

zbMATH Keywords

sparsityheuristic algorithmNP-hardelectrical networksuboptimalityoptimal cycle basisvoltage equations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Paths and cycles (05C38)

Cited In (1)

• Minimal cycle basis of graph products for the force method of frame analysis

This page was built for publication: On optimal cycle bases of graphs for mesh analysis of networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484660)