Sciweavers

7796 search results - page 40 / 1560
» On Generalized Schur Numbers
Sort
View
AMC
2006
79views more  AMC 2006»
13 years 10 months ago
General fuzzy linear systems
In this talk, We investigate the m
Bing Zheng, Ke Wang
DAM
1998
67views more  DAM 1998»
13 years 9 months ago
A Graph-theoretic Generalization of the Sauer-Shelah Lemma
We show a natural graph-theoretic generalization of the Sauer–Shelah lemma. This result is applied to bound the ‘∞ and L1 packing numbers of classes of functions whose range...
Nicolò Cesa-Bianchi, David Haussler
EJC
2010
13 years 10 months ago
A linear equation for Minkowski sums of polytopes relatively in general position
The objective of this paper is to study a special family of Minkowski sums, that is of polytopes relatively in general position. We show that the maximum number of faces in the su...
Komei Fukuda, Christophe Weibel
SODA
2003
ACM
138views Algorithms» more  SODA 2003»
13 years 11 months ago
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearr...
Hung Q. Ngo, Van H. Vu
IWOCA
2009
Springer
157views Algorithms» more  IWOCA 2009»
14 years 4 months ago
Forbidden Subgraph Colorings and the Oriented Chromatic Number
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
N. R. Aravind, C. R. Subramanian