Sciweavers

803 search results - page 27 / 161
» Independence in Direct-Product Graphs
Sort
View
ICALP
2009
Springer
14 years 7 months ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
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...
Elena Losievskaja, Geir Agnarsson, Magnús M...
DM
2010
129views more  DM 2010»
13 years 7 months ago
Interpolating between bounds on the independence number
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)...
Anett Boßecker, Dieter Rautenbach
AMTA
2000
Springer
13 years 11 months ago
Oxygen: A Language Independent Linearization Engine
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...
Nizar Habash
AUSAI
2005
Springer
14 years 29 days ago
Fuzzy Attribute Implications: Computing Non-redundant Bases Using Maximal Independent Sets
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 ...
Radim Belohlávek, Vilém Vychodil
GBRPR
2003
Springer
14 years 18 days ago
Constructing Stochastic Pyramids by MIDES - Maximal Independent Directed Edge Set
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 ...
Yll Haxhimusa, Roland Glantz, Walter G. Kropatsch