1. Breadth first traversal or BFS for a graph. http://www.geeksforgeeks.org/breadth-first-traversal-for-a-graph/. Breadth first traversal or BFS for a graph. http://www.geeksforgeeks.org/breadth-first-traversal-for-a-graph/.
2. A. V. Aho J. E. Hopcroft and J. Ullman. Data Structures and Algorithms. Addison-Wesley Longman Publishing Co. Inc. Boston MA USA 1st edition 1983. A. V. Aho J. E. Hopcroft and J. Ullman. Data Structures and Algorithms. Addison-Wesley Longman Publishing Co. Inc. Boston MA USA 1st edition 1983.
3. An orchestrated survey of methodologies for automated software test case generation
4. The NAS parallel benchmarks---summary and preliminary results
5. On the Termination of Integer Loops