Recognition algorithms for binary signed-graphic matroids
Combinatorics
2012-05-08 v2
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.
Keywords
Cite
@article{arxiv.1011.6504,
title = {Recognition algorithms for binary signed-graphic matroids},
author = {Leonidas Pitsoulis and Konstantinos Papalamprou},
journal= {arXiv preprint arXiv:1011.6504},
year = {2012}
}
Comments
This paper has been withdrawn by the authors due to a newly submitted version