Spanning circuits in regular matroids

DOI10.1137/1.9781611974782.93MaRDI QIDQ4575836zbMATH OpenOpenAlexFDO

Authors Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh

Publication date 16 July 2018

Published in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974782.93

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Spanning circuits in regular matroids
• Spanning cycles in regular matroids without small cocircuits
• Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
• Covering Vectors by Spaces: Regular Matroids
• On the number of circuits in regular matroids (with connections to lattices and codes)

Cited in

(8)

• Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
• Spanning cycles in regular matroids without small cocircuits
• Covering Vectors by Spaces: Regular Matroids
• Spanning circuits in regular matroids
• On the number of circuits in regular matroids (with connections to lattices and codes)
• Covering vectors by spaces in perturbed graphic matroids and their duals
• Covering vectors by spaces: regular matroids
• On the number of circuits in regular matroids (with connections to lattices and codes)

This page was built for publication: Spanning circuits in regular matroids

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