Sciweavers

650 search results - page 8 / 130
» Positive graphs
Sort
View
EJC
2006
14 years 9 months ago
The positive Bergman complex of an oriented matroid
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...
Federico Ardila, Caroline J. Klivans, Lauren Willi...
EJC
2008
14 years 9 months ago
Graph parameters and semigroup functions
Abstract. We prove a general theorem on semigroup functions that implies characterizations of graph partition functions in terms of the positive semidefiniteness (`reflection posit...
László Lovász, Alexander Schr...
CCCG
2009
14 years 10 months ago
On the Dilation of Delaunay Triangulations of Points in Convex Position
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
Shiliang Cui, Iyad A. Kanj, Ge Xia
ECCV
2006
Springer
15 years 11 months ago
Automatic Image Segmentation by Positioning a Seed
We present a method that automatically partitions a single image into non-overlapping regions coherent in texture and colour. An assumption that each textured or coloured region ca...
Branislav Micusík, Allan Hanbury
COMBINATORICS
2007
68views more  COMBINATORICS 2007»
14 years 9 months ago
Compositions of Graphs Revisited
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
Aminul Huq