| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652439 | Electronic Notes in Discrete Mathematics | 2009 | 6 Pages |
Abstract
We present an algorithm which takes a graph as input and decides in polynomial 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
