Parallel Maximum Clique (PMC) Library. A parameterized high performance library for computing maximum cliques in large sparse graphs. Features: General framework for parallel maximum clique algorithms. Optimized to be fast for large sparse graphs. Algorithms tested on networks of 1.8 billion edges. Set of fast heuristics shown to give accurate approximations. Algorithms for computing Temporal. Strongly Connected Components (TSCC) of large dynamic networks. Parameterized for computing k-cliques as fast as possible. Includes a variety of tight linear time bounds for the maximum clique problem. Ordering of vertices for each algorithm can be selected at runtime. Dynamically reduces the graph representation periodically as vertices are pruned or searched, thus lowering memory-requirements for massive graphs, increases speed, and has caching benefits.