746 search results - page 5 / 150 » On the Generation of Oriented Matroids |
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X â...
IPCO
2007
15 years 1 months ago
2007
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
DCG
2000
14 years 11 months ago
2000
In this paper we consider the cocircuit graph GM of an oriented matroid M, the 1-skeleton of the cell complex W formed by the span of the cocircuits of M. In general, W is not dete...
GD
1994
Springer
15 years 3 months ago
1994
Springer
We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank ...
DCG
2002
14 years 11 months ago
2002
Let V be a vector space of dimension d over a field K and let A be a central arrangement of hyperplanes in V. To answer a question posed by K. Aomoto, P. Orlik and H. Terao constru...