Some more residue=alpha data

I plan to take a fresh look at the lower bound theory for the independence number. If a graph has a pendant vertex then that pendant can always be included in a maximum independent set. Critical independent sets are a generalization of this notion. And they can be efficiently identified and included in a maximum independent set. So we restrict our  attention to graphs with empty critical independent sets (so \alpha'=0).

Residue is the best lower bound I have tested. This summer Jochen Harant told me of a bound I have not yet programmed but will do this very soon. Here is the new data:

alpha-residue-table

 

 

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s