9 search results - page 2 / 2 » On the Cocircuit Graph of an Oriented Matroid |
GD
1994
Springer
13 years 10 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 ...
EJC
2006
13 years 6 months ago
2006
We study the positive Bergman complex B+ (M) of an oriented matroid M, which is a certain subcomplex of the Bergman complex B(M) of the underlying unoriented matroid M. The positiv...
COMPGEOM
2003
ACM
13 years 11 months ago
2003
ACM
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
FOCS
2006
IEEE
14 years 9 days ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...