Some months ago, a very nice web page came out. I am talking about the catalogue of enumeration algorithms by Kunihiro Wasa. There you can find an “Enumeration of Enumeration Algorithms and Its Complexity”.
For each class of the followings:
- Geometry
- Graph
- Hypergraph
- Matroid
- Order
- Other
- Permutation
- SAT
- Set
- String
several enumeration problems are enumerated. For each of them, the state of the art is given. Enjoy!