Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-24T07:54:43.877Z Has data issue: false hasContentIssue false

14 - Weighted Graphs

from Part III - Modeling Complex Networks

Published online by Cambridge University Press:  02 March 2023

Alan Frieze  and
Michał Karoński
Alan Frieze
Affiliation:
Carnegie Mellon University, Pennsylvania
Michał Karoński
Affiliation:
Adam Mickiewicz University, Poznań, Poland
Get access

Summary

There are many cases in which we put weights on the edges of a graph or digraph and ask for the minimum or maximum weight object. The optimization questions that arise from this are the backbone of Combinatorial optimization. When the weights are random variables, we can ask for properties of the optimum value, which will be also a random variable. In this chapter, we consider three of the most basic optimization problems: minimum weight spanning trees, shortest paths, and minimum weight matchings.

Keywords

weighted graphsminimum weight spanning treeshortest pathsminimum weight matching
Type
Chapter
Information
Random Graphs and Networks: A First Course , pp. 197 - 209
Publisher: Cambridge University Press
Print publication year: 2023

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Weighted Graphs
  • Alan Frieze, Carnegie Mellon University, Pennsylvania, Michał Karoński, Adam Mickiewicz University, Poznań, Poland
  • Book: Random Graphs and Networks: A First Course
  • Online publication: 02 March 2023
  • Chapter DOI: https://doi.org/10.1017/9781009260268.018
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Weighted Graphs
  • Alan Frieze, Carnegie Mellon University, Pennsylvania, Michał Karoński, Adam Mickiewicz University, Poznań, Poland
  • Book: Random Graphs and Networks: A First Course
  • Online publication: 02 March 2023
  • Chapter DOI: https://doi.org/10.1017/9781009260268.018
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Weighted Graphs
  • Alan Frieze, Carnegie Mellon University, Pennsylvania, Michał Karoński, Adam Mickiewicz University, Poznań, Poland
  • Book: Random Graphs and Networks: A First Course
  • Online publication: 02 March 2023
  • Chapter DOI: https://doi.org/10.1017/9781009260268.018
Available formats
×