EJC
2011
13 years 7 months ago
2011
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 algor...
COMBINATORICS
2004
14 years 9 days ago
2004
We introduce intersection schemes (a generalization of uniform oriented matroids of rank 3) to describe the combinatorial properties of arrangements of pseudocircles in the plane ...