36 search results - page 5 / 8 » New Bounds for Union-free Families of Sets |
WG
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
82
Voted
RECOMB
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
JSYML
2010
14 years 4 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
CRV
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
MFCS
2007
Springer
15 years 3 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...