Weighted Graphs

  • K. Erciyes
Part of the Texts in Computer Science book series (TCS)


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.


  1. 1.
    Acar UA, Blelloch GE (2017) Algorithm design: parallel and sequential. Chapter 18, Draft book, Carnegie Mellon University, Dept. of Computer Science.
  2. 2.
    Bellman R (1958) On a routing problem. Q Appl Math 16:87–90MathSciNetCrossRefGoogle Scholar
  3. 3.
    Boruvka O (1926) About a certain minimal problem. Prce mor. prrodoved. spol. v Brne III (in Czech, German summary), 3:37–58Google Scholar
  4. 4.
    Chung S, Condon A (1996) Parallel implementation of Boruvka’s minimum spanning tree algorithm. Technical report 1297, Computer Sciences Dept., University of WisconsinGoogle Scholar
  5. 5.
    Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press, Cambridge, Chapter 23Google Scholar
  6. 6.
    Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1:269–271MathSciNetCrossRefGoogle Scholar
  7. 7.
    Erciyes K (2013) Distributed graph algorithms for computer networks. Chapter 6, Springer computer communications and networks series. Springer, BerlinCrossRefGoogle Scholar
  8. 8.
    Gallager RG, Humblet PA, Spira PM (1983) Distributed algorithms for mininimum-weight spanning trees. ACM Trans Progrmm Lang Syst 5(1):66–77CrossRefGoogle Scholar
  9. 9.
    Graham RL, Hell P (1985) On the history of the minimum spanning tree problem. Ann Hist Comput 7(1):4357MathSciNetCrossRefGoogle Scholar
  10. 10.
    Grama A, Gupta A, Karypis G, Kumar V (2003) Introduction to parallel computing, 2nd edn. Chapter 10. Addison Wesley, BostonGoogle Scholar
  11. 11.
    Kleinberg J, Tardos E (2005) Algorithm design. Chapter 4. Pearson Int. Ed. ISBN-13: 978-0321295354 ISBN-10: 0321295358Google Scholar
  12. 12.
    Korte B, Vygen J (2008) Combinatorial optimization: theory and algorithms. Chapter 7, 4th edn. Springer, BerlinGoogle Scholar
  13. 13.
    Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7:4850MathSciNetCrossRefGoogle Scholar
  14. 14.
    Loncar V, Skrbic S, Bala A (2013) Parallelization of minimum spanning tree algorithms using distributed memory architectures. Transaction on engineering technology. Special volume of the world congress on engineering, pp 543–554CrossRefGoogle Scholar
  15. 15.
    Peleg D (1987) Distributed computing: a locality-sensitive approach SIAM monographs on discrete mathematics and applications. Chapter 5Google Scholar
  16. 16.
    Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36(6):1389–1401CrossRefGoogle Scholar
  17. 17.
    Tarjan RE (1987) Data structures and network algorithms. SIAM, CBMS-NSF regional conference series in applied mathematics (Book 44)Google Scholar
  18. 18.
    Thorup M (2000) Near-optimal fully-dynamic graph connectivity. In: Proceedings of the 32nd ACM symposium on theory of computing, pp 343–350Google Scholar
  19. 19.
    Toueg S (1980) An all-pairs shortest-path distributed algorithm. Technical report RC 8327, IBM TJ Watson Research Center, Yorktown Heights, NY 10598Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.International Computer InstituteEge UniversityIzmirTurkey

Personalised recommendations