Skip to main content

Algorithms on Graphs

  • Chapter
  • First Online:
  • 5833 Accesses

Abstract

Weighted network: A weighted network (V, E, C) consists of a node set V, an edge set E, and the weight set C specifying weights c ij for the edges (i, j) ∈ E.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Santanu Saha Ray .

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer India

About this chapter

Cite this chapter

Saha Ray, S. (2013). Algorithms on Graphs. In: Graph Theory with Algorithms and its Applications. Springer, India. https://doi.org/10.1007/978-81-322-0750-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-0750-4_5

  • Published:

  • Publisher Name: Springer, India

  • Print ISBN: 978-81-322-0749-8

  • Online ISBN: 978-81-322-0750-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics