Minimum cycle bases, faster and simpler

DOI10.1145/1644015.1644023zbMATH Open1300.05304OpenAlexW2095422835MaRDI QIDQ6486930FDOQ6486930

Authors: K. Mehlhorn, Dimitrios Michail 

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1644015.1644023

Recommendations

• An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
• New Approximation Algorithms for Minimum Cycle Bases of Graphs
• New approximation algorithms for minimum cycle bases of graphs
• Faster Algorithms for Minimum Cycle Basis in Directed Graphs
• Automata, Languages and Programming

zbMATH Keywords

cycle spaceminimum cycle basissparse basis

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Paths and cycles (05C38)

This page was built for publication: Minimum cycle bases, faster and simpler

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