Reading List
Posts to be done
- Basically available soft state eventual consistency
- Bloom Filters, caching your way to performance
- CAP theorem
- Components of a database management system
- Designing a graph file system
- Gossip protocols
- Haskell all you need to know - Turned into haskell.zcourts.com
- Haskell FFI, working with C libraries (see above)
- Imutability, a beautiful future
- Introduction to the fundamentals of graph theory
- Log structured merge trees for the rest of us (and why it doesn't work for graphs)
- Voltage Cluster (Finding communities in linear time: a physics approach)
- Markov cluster (http://micans.org/mcl/) Thesis => http://micans.org/mcl/index.html?sec_thesisetc
- Network modularity - http://en.wikipedia.org/wiki/Modularity_(networks)
- Clique - http://en.wikipedia.org/wiki/Clique(graphtheory)
- Fuzy clustering - http://en.wikipedia.org/wiki/Fuzzy_clustering
- BIRCH - http://en.wikipedia.org/wiki/Birch(dataclustering)
TODO
Update with list of papers in the repo.
Problems that can be solved with graphs
Having data represented as graphs is one thing but once you have that graph, what do you want to know about it? What can it tell you? This is a collection of resources with ideas of how to use graphs or graph algorithms.
Graphs from real life problems question Data for testing graphs question Generating interesting combinatorial optimization problems
Stanford network analysis project - SNAP Data collection from SNAP
Nauty and traces - new site Nauty and Traces - generate graphs, old site
The Open Graph Archive: A Community-Driven Effort Graph archive
UCI Network Data Repository UCI Public dataset
Washington state graph dataset
GraphChi technique GraphLab's DataSet
Networks, Crowds and Markets, reasoning about a highly connected world
Introduction to graph theory- Wikibooks