Sciweavers

Share
AAIM
2011
Springer
337views Algorithms» more  AAIM 2011»
9 years 3 months ago
On Variants of the Spanning Star Forest Problem
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
Jing He, Hongyu Liang
PROPERTYTESTING
2010
9 years 9 months ago
On Constant Time Approximation of Parameters of Bounded Degree Graphs
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
Noga Alon
CORR
2004
Springer
95views Education» more  CORR 2004»
9 years 11 months ago
Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance
Let ( ) denote the maximum size of a -ary code of length and distance . We study the minimum asymptotic redundancy ( ) = log ( ) as grows while and are fixed. For any and 1, long a...
Sergey Yekhanin, Ilya Dumer
EJC
2006
9 years 11 months ago
Product representations of polynomials
For a fixed polyomial f Z[X], let k(N) denote the maximum size of a set A {1, 2, . . . , N} such that no product of k distinct elements of A is in the value set of f. In this pap...
Jacques Verstraëte
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
9 years 11 months ago
Sets of Points Determining Only Acute Angles and Some Related Colouring Problems
We present both probabilistic and constructive lower bounds on the maximum size of a set of points S Rd such that every angle determined by three points in S is acute, considerin...
David Bevan
books