2 research outputs found
Cubic Time Recognition of Cocircuit Graphs of Uniform Oriented Matroids
We present an algorithm which takes a graph as input and decides in cubic
time if the graph is the cocircuit graph of a uniform oriented matroid. In the
affirmative case the algorithm returns the set of signed cocircuits of the
oriented matroid. This improves an algorithm proposed by Babson, Finschi and
Fukuda.
Moreover we strengthen a result of Montellano-Ballesteros and Strausz about
crabbed connectivity of cocircuit graphs of uniform oriented matroids.Comment: 9 page