Spanning Circuits in Regular Matroids

DOI10.1137/1.9781611974782.93zbMath1410.68164OpenAlexW2485295414MaRDI QIDQ4575836

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

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

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

Related Items (2)

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