Covering vectors by spaces: regular matroids

DOI10.4230/LIPICS.ICALP.2017.56zbMATH Open1441.68106MaRDI QIDQ5111387FDOQ5111387

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

Publication date: 27 May 2020

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

zbMATH Keywords

parameterized complexityspanning setregular matroids

Mathematics Subject Classification ID

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

Cited In (2)

• On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)
• Covering Vectors by Spaces: Regular Matroids

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)