The Complexity of Deletion Problems for Matroids

DOI10.1137/110852383zbMATH Open1268.05043OpenAlexW2029236421MaRDI QIDQ5300502

Michael Snook

Publication date: 27 June 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

NP-hardmatroiddeletion

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (3)

GlobaL analysis of the deiete-contract recursion for graphs and matroids ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?)

This page was built for publication: The Complexity of Deletion Problems for Matroids

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