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 (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 21 July 2019

Fundamental network algorithms

Fundamental network algorithms

A discussion of some of the most important and fundamental algorithms for performing network calculations on a computer

Chapter:
(p.308) Chapter 10 Fundamental network algorithms
Source:
Networks
Author(s):

M. E. J. Newman

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199206650.003.0010

This chapter looks at the algorithms used to perform network calculations. It starts with some simple algorithms for calculating quantities such as degrees, degree distributions, and clustering before moving on to more sophisticated algorithms for shortest paths, betweenness, maximum flows, and other non-local quantities. Exercises are provided at the end of the chapter.

Keywords:   network algorithms, network calculations, degrees, degree distributions, clustering coefficients, shortest paths

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 .