746 search results - page 7 / 150 » On the Generation of Oriented Matroids |
JCT
2008
13 years 7 months ago
2008
ESA
2006
Springer
13 years 11 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
ICCV
2003
IEEE
14 years 23 days ago
2003
IEEE
Multiple projections of a scene cannot be arbitrary, the allowed configurations being given by matching constraints. This paper presents new matching constraints on multiple proj...
COMBINATORICS
2002
13 years 7 months ago
2002
A sink-free orientation of a finite undirected graph is a choice of orientation
ORDER
2011
13 years 2 months ago
2011
We prove a Hadwiger transversal type result, characterizing convex position on a family of non-crossing convex bodies in the plane. This theorem suggests a definition for the ord...