Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

ORL
2007

favoriteEmaildiscussreport

102views more ORL 2007»

Using critical sets to solve the maximum independent set problem

13 years 10 months ago

Using critical sets to solve the maximum independent set problem

Download ise.tamu.edu

A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent set is developed. The eﬀectiveness of the proposed approach on large graphs with large independence number is demonstrated through extensive numerical experiments. Key words: Maximum independent set, critical set, large-scale discrete optimization

Sergiy Butenko, Svyatoslav Trukhanov

Real-time Traffic

Critical Independent Set | Critical Set | Large Independence Number | ORL 2007 |

claim paper

Related Content

» On the practical complexity of solving the maximum weighted independent set problem for op...

» Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes

» Messagepassing for Maximum Weight Independent Set

» Comparison of maximum entropy and minimal mutual information in a nonlinear setting

» SDPBased Algorithms for Maximum Independent Set Problems on Hypergraphs

» A Note on the Use of Independent Sets for the kSAT Problem

» Multiobject Tracking as Maximum Weight Independent Set

» Finding Independent Sets in Unions of Perfect Graphs

» Improved Approximations of Independent Sets in BoundedDegree Graphs

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	ORL
Authors	Sergiy Butenko, Svyatoslav Trukhanov

Comments (0)