Recognition algorithms for binary signed-graphic matroids

From MaRDI portal



Abstract: In this paper we provide two recognition algorithms for the class of signed-graphic matroids along with necessary and sufficient conditions for a matroid to be signed-graphic. Specifically, we provide a polynomial-time algorithm which determines whether a given binary matroid is signed-graphic and an algorithm which determines whether a general matroid given by an independece oracle is binary signed-graphic.











This page was built for publication: Recognition algorithms for binary signed-graphic matroids

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