Covering vectors by spaces: regular matroids

DOI10.4230/LIPICS.ICALP.2017.56MaRDI QIDQ5111387zbMATH OpenFDO

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

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2017.56

zbMATH Keywords

parameterized complexityregular matroidsspanning set

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27) Analysis of algorithms (68W40)

Recommendations

• Covering Vectors by Spaces: Regular Matroids
• Spanning circuits in regular matroids
• Spanning circuits in regular matroids
• A decomposition theory for matroids. V: Testing of matrix total unimodularity
• Finding branch-decompositions of matroids, hypergraphs, and more

Cited in

(3)

• Covering Vectors by Spaces: 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

This page was built for publication: Covering vectors by spaces: regular matroids

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