Note on recognition of matroid systems

DOI10.1016/0167-6377(91)90002-7MaRDI QIDQ1180837zbMATH OpenOpenAlexFDO

Authors Jeremy P. Spinrad

Publication date 27 June 1992

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(91)90002-7

zbMATH Keywords

clutterrecognition algorithm for matroid systems

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 4095482
• Improved Bounds for Matroid Partition and Intersection Algorithms
• Determining when a graphic matroid is transversal in linear time
• Recognition algorithms for binary signed-graphic matroids
• scientific article; zbMATH DE number 4068895

Cited in

(4)

• On the recognition of \(S\)-systems
• scientific article; zbMATH DE number 4095482 (Why is no real title available?)
• scientific article; zbMATH DE number 4110705 (Why is no real title available?)
• Recognizing Even-Cycle and Even-Cut Matroids

This page was built for publication: Note on recognition of matroid systems

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