Recognition algorithms for binary signed-graphic matroids

Details Recognition algorithms for binary signed-graphic matroids Recognition algorithms for binary signed-graphic matroids

2010-11-30

arxiv.org/abs/1011.6504v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Recognition algorithms for binary signed-graphic matroids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Recognition algorithms for binary signed-graphic matroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recognition algorithms for binary signed-graphic matroids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-445171