803 search results - page 27 / 161 » Independence in Direct-Product Graphs |
169
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
119
click to vote
DM
2010
15 years 3 months ago
2010
For a non-negative integer T, we prove that the independence number of a graph G = (V, E) in which every vertex belongs to at most T triangles is at least uV f(d(u), T) where d(u)...
114
Voted
AMTA
2000
Springer
15 years 8 months ago
2000
Springer
This paper describes a language independent linearization engine, oxyGen. This system compiles target language grammars into programs that take feature graphs as inputs and genera...
110
click to vote
AUSAI
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This note describes a method for computation of non-redundant bases of attribute implications from data tables with fuzzy attributes. Attribute implications are formulas ...
131
click to vote
GBRPR
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...