Weighted Graphs

A weighted graph can have weights associated with its edges or its vertices. The weight on an edge typically denotes the cost of traversing that edge and the weights of a vertex commonly show its capacity to perform some function. In this chapter, we review sequential, parallel, and distributed algo...

Full description

Saved in:
Bibliographic Details
Published inGuide to Graph Algorithms pp. 177 - 219
Main Author Erciyes, K
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2018
Springer International Publishing
SeriesTexts in Computer Science
Subjects
All Pairs Shortest Path (APSP)
Minimum Spanning Tree (MST)
Minimum Weight Outgoing Edge (MWOE)
Single Source Shortest Path (SSSP)
SSSP Algorithm
Online AccessGet full text
ISBN331973234X
9783319732343
ISSN1868-0941
1868-095X
DOI10.1007/978-3-319-73235-0_7

Cover

More Information
Summary:A weighted graph can have weights associated with its edges or its vertices. The weight on an edge typically denotes the cost of traversing that edge and the weights of a vertex commonly show its capacity to perform some function. In this chapter, we review sequential, parallel, and distributed algorithms for weighted graphs for two specific tasks; the minimum spanning tree problem and the shortest path problem.
ISBN:331973234X
9783319732343
ISSN:1868-0941
1868-095X
DOI:10.1007/978-3-319-73235-0_7