Computational Combinatorics

Month: November, 2012

A Visual Guide to Combinatorial Search

Today, we investigate a way to visualize combinatorial search in a way that touches on most of the computational and mathematical concerns. Throughout the description, we shall refer to a common example of generating graphs using edge augmentations. Since we’ve already seen some combinatorial searches before (see Introduction to Canonical Deletion and Introduction to Orbital Branching for examples), some of this discussion will seem familiar.

Read the rest of this entry »

New Page: Computational Resources

I added a new page for computational combinatorics resources. It contains a list of software and lists of graph classes. Please let me know if you know of other resources that can be useful and I will update the page.

Sorry for the lack of posts, but we will return shortly to investigate some example implementations of canonical deletion.