54 search results - page 2 / 11 » Finding a Maximum Independent Set in a Sparse Random Graph |
JACM
2010
14 years 10 months ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
CPC
2006
14 years 11 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
115
click to vote
ICALP
2009
Springer
15 years 11 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...
JGT
2006
14 years 11 months ago
2006
We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family i...