Towards Lower Bounds on Number of Dimensions for Word Embeddings
A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components