Graph classes where Independence Number can be Efficiently computed

Patrick just pointed out this amazing database to me of graph classes where the independence number can be efficently computed. We should be able to use this to knock out some difficult graphs. Soon we’ll be to the point where we have to move our computations to a bigger machine, and then to where we need to write our own generators – to only generate potential difficult graphs.

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