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 independence oracle is binary signed-graphic. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Papalamprou, K., & Pitsoulis, L. (2012). Recognition algorithms for binary signed-graphic matroids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7422 LNCS, pp. 463–474). https://doi.org/10.1007/978-3-642-32147-4_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
