Cubic Time Recognition of Cocircuit Graphs of Uniform Oriented Matroids
Combinatorics
2010-01-21 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1001.3534,
title = {Cubic Time Recognition of Cocircuit Graphs of Uniform Oriented Matroids},
author = {Stefan Felsner and Ricardo Gomez and Kolja Knauer and Juan Jose Montellano-Ballesteros and Ricardo Strausz},
journal= {arXiv preprint arXiv:1001.3534},
year = {2010}
}
Comments
9 pages