Basic concepts of algorithms
Mark E. J. Newman · Networks · 2010
This chapter describes some simple but important ideas about the running time of algorithms and data structures for the storage of networks. The adjacency matrix, adjacency list, trees, and other network representations are discussed. Exercises are provided at the end of the chapter.