Recognition algorithms for binary signed-graphic matroids
Leonidas Pitsoulis, Konstantinos Papalamprou
TL;DR
This paper introduces two polynomial-time algorithms for recognizing binary signed-graphic matroids, providing necessary and sufficient conditions for their identification, which advances understanding and computational methods in matroid theory.
Contribution
The paper presents the first polynomial-time algorithms for recognizing binary signed-graphic matroids and establishes necessary and sufficient conditions for their recognition.
Findings
A polynomial-time algorithm for recognizing binary signed-graphic matroids.
An algorithm for recognizing general matroids as binary signed-graphic given an independence oracle.
Necessary and sufficient conditions for a matroid to be signed-graphic.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Digital Image Processing Techniques