Resources to find the "best" algorithm for a problem? There are many question that pose a none obscure problem and ask for the "best" algorithm, whatever "best" means.

For example, Given a graph, decide if its edge connectivity is at least n/2 or not, 

The normal process is to search the literature with every single name of the problem, and find a recent paper. Usually the "best" result will be the one of the references. A more recent approach is to ask the question here.

Are there websites specifically dedicated with information like this? A database of problems and list of algorithms with their complexities? I am imagining an OEIS for problems instead of integer sequences.
There's an attempt to build such a resource. It's called the Complexity Garden and is "the botanical companion to the Complexity Zoo". Also see this meta discussion.