Jump to ContentJump to Main Navigation
NetworksAn Introduction$
Users without a subscription are not able to see the full content.

Mark Newman

Print publication date: 2010

Print ISBN-13: 9780199206650

Published to Oxford Scholarship Online: September 2010

DOI: 10.1093/acprof:oso/9780199206650.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 19 January 2021

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

(p.275) Chapter 9 Basic concepts of algorithms

M. E. J. Newman

Oxford University Press

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 .