%0 Journal Article
%T Recognition algorithms for binary signed-graphic matroids
%A Leonidas Pitsoulis
%A Konstantinos Papalamprou
%J Mathematics
%D 2010
%I arXiv
%X 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.
%U http://arxiv.org/abs/1011.6504v2