Basic concepts of algorithms
Basic concepts of algorithms
An introduction to some of the basic concepts of computer algorithms for network calculations, particularly data structures for storing networks and methods for estimating the time computations will take
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.
Keywords: network algorithms, network calculations, network data, network storage
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .
