Shortest Paths

Finding the shortest shortest path between two vertices in a weighted graph has many applications. A fundamental implementation involves sending packets over shortest routes, therefore, in shortest possible time between two routers in a computer network. This so-called routing problem is commonly so...

Full description

Saved in:
Bibliographic Details
Published inAlgebraic Graph Algorithms pp. 109 - 125
Main Author Erciyes, K
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2021
Springer International Publishing
SeriesUndergraduate Topics in Computer Science
Online AccessGet full text
ISBN3030878856
9783030878856
ISSN1863-7310
2197-1781
DOI10.1007/978-3-030-87886-3_7

Cover

Abstract Finding the shortest shortest path between two vertices in a weighted graph has many applications. A fundamental implementation involves sending packets over shortest routes, therefore, in shortest possible time between two routers in a computer network. This so-called routing problem is commonly solved by converting a graph routing algorithm to a distributed one in the form of a network protocol to be executed by each router. We look at basic graph algorithms to find shortest paths in a weighted graph in this chapter.
AbstractList Finding the shortest shortest path between two vertices in a weighted graph has many applications. A fundamental implementation involves sending packets over shortest routes, therefore, in shortest possible time between two routers in a computer network. This so-called routing problem is commonly solved by converting a graph routing algorithm to a distributed one in the form of a network protocol to be executed by each router. We look at basic graph algorithms to find shortest paths in a weighted graph in this chapter.
Author Erciyes, K
Author_xml – sequence: 1
  fullname: Erciyes, K
BookMark eNo1j81OwzAQhBcoiLSUF-DCCxi83sRrH1HFn1QJJHq3YtehQJWEOLw_bgunHc1oRvtNYdJ2bQS4QnmDUvKtZSNISJLCsDFakOMjmGeXsre36BgKhZYFssETmP4HlZ5AgTkXTCjPYIrKMFKlpTmHeUqfUkrFaBHLAi7fNt0wxjRev9bjJl3AaVNvU5z_3RmsHu5XiyexfHl8XtwtRW-YhQ0hRrJcBqmZlfJaBR9L9I2p2XNjNaFeW1qbta0VEvoYvLZNQ8orLiuaAR5mUz98tO9xcL7rvpJD6XbwLmM6cpnH7Umz5twpD51-6L5_8scu7kohtuNQb8Om7sc4JKeNtLrC3Y5DNPQLowJXhA
ContentType Book Chapter
Copyright Springer Nature Switzerland AG 2021
Copyright_xml – notice: Springer Nature Switzerland AG 2021
DBID FFUUA
DOI 10.1007/978-3-030-87886-3_7
DatabaseName ProQuest Ebook Central - Book Chapters - Demo use only
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9783030878863
3030878864
EISSN 2197-1781
EndPage 125
ExternalDocumentID EBC6809651_100_118
GroupedDBID 38.
AABBV
AABLV
ACWLQ
AEJLV
AEKFX
AELOD
AIYYB
ALMA_UNASSIGNED_HOLDINGS
BAHJK
BBABE
CZZ
DBWEY
FFUUA
IEZ
OCUHQ
ORHYB
SBO
TPJZQ
Z7R
Z7U
Z7X
Z7Z
Z81
Z83
Z84
Z85
Z88
ID FETCH-LOGICAL-p877-9ccee3974c067722b62cbe41bf8a7b7f96316d93d8d9a2131becb69ff32b27453
ISBN 3030878856
9783030878856
ISSN 1863-7310
IngestDate Tue Jul 29 20:27:46 EDT 2025
Thu May 29 00:14:54 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCallNum QA75.5-76.95
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-p877-9ccee3974c067722b62cbe41bf8a7b7f96316d93d8d9a2131becb69ff32b27453
OCLC 1287135608
PQID EBC6809651_100_118
PageCount 17
ParticipantIDs springer_books_10_1007_978_3_030_87886_3_7
proquest_ebookcentralchapters_6809651_100_118
PublicationCentury 2000
PublicationDate 2021
PublicationDateYYYYMMDD 2021-01-01
PublicationDate_xml – year: 2021
  text: 2021
PublicationDecade 2020
PublicationPlace Switzerland
PublicationPlace_xml – name: Switzerland
– name: Cham
PublicationSeriesTitle Undergraduate Topics in Computer Science
PublicationSeriesTitleAlternate Undergraduate Topics Computer Sci.
PublicationSubtitle A Practical Guide Using Python
PublicationTitle Algebraic Graph Algorithms
PublicationYear 2021
Publisher Springer International Publishing AG
Springer International Publishing
Publisher_xml – name: Springer International Publishing AG
– name: Springer International Publishing
RelatedPersons Pitts, Andrew
Hinchey, Mike
Kozen, Dexter C.
Abramsky, Samson
Stewart, Iain
Hankin, Chris
Skiena, Steven S.
Mackie, Ian
Riis Nielson, Hanne
RelatedPersons_xml – sequence: 1
  givenname: Ian
  surname: Mackie
  fullname: Mackie, Ian
– sequence: 2
  givenname: Samson
  orcidid: 0000-0003-3921-6637
  surname: Abramsky
  fullname: Abramsky, Samson
– sequence: 3
  givenname: Chris
  orcidid: 0000-0001-9149-8577
  surname: Hankin
  fullname: Hankin, Chris
– sequence: 4
  givenname: Mike
  orcidid: 0000-0001-5110-561X
  surname: Hinchey
  fullname: Hinchey, Mike
– sequence: 5
  givenname: Dexter C.
  surname: Kozen
  fullname: Kozen, Dexter C.
– sequence: 6
  givenname: Andrew
  orcidid: 0000-0001-7775-3471
  surname: Pitts
  fullname: Pitts, Andrew
– sequence: 7
  givenname: Hanne
  orcidid: 0000-0002-2484-5580
  surname: Riis Nielson
  fullname: Riis Nielson, Hanne
– sequence: 8
  givenname: Steven S.
  surname: Skiena
  fullname: Skiena, Steven S.
– sequence: 9
  givenname: Iain
  orcidid: 0000-0002-0752-1971
  surname: Stewart
  fullname: Stewart, Iain
SSID ssj0002719114
Score 1.6135575
Snippet Finding the shortest shortest path between two vertices in a weighted graph has many applications. A fundamental implementation involves sending packets over...
SourceID springer
proquest
SourceType Publisher
StartPage 109
Title Shortest Paths
URI http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=6809651&ppg=118
http://link.springer.com/10.1007/978-3-030-87886-3_7
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT-MwELaW7gWtELssqy2wqx44Ublq7NR2jggVKvZxoay4RbFjUyS2RX0c4NczY-fRBi5wiRzLiu2ZZDIznvmGkGOhjchUYqlwOqGx1ZJqrgUVIgeLKO-7QYbZyH_-itF1fHkzuKmrAvrskqXumadX80rew1XoA75iluwbOFs9FDqgDfyFK3AYrg3ld9PNGsKL72_x0PfOdC8QdLoL9zOw9Cf_ay15bu4egxj41Vt_N64mGGK7WCJA_yQMx_XaRSiDdDvP8hXooN3x7AFBnH1iYCj-UMqCdWcBixrOgtJZ2HA31h6vDeuSe7hApQLydyEgleBU8iIU1fo-EHoINBlKrxSCMOona__UKCQ3vxDX6xEaMBnF2QTlqdwiWzB_i3w8HV7-_lc5zZgE89LjtVfrwHydap0BUam-r2CmApJwY5INo6JxDu7Vi_Fn8glTTjqYCwIE-0I-2Oke2S1p3ilo_pXslIzreMbtk_H5cHw2okVBC_qg8KTcgEYC-l9sELaPMS2Y0TaOtFOZ1NKBLIxEnvBc5UnGIh7B96VF4hxnmsl4wL-R1nQ2td9JB34N0ijQ5aWyceLga3OaGWYdk5YJo9uElltL_al7EeprwkYWqVAI-xMhZDUYgapNTsr9pzh8kZZw1kC3lKdAt9TTDdry4C2DD8l2_SIekdZyvrI_QI9b6p8Fd58BZmM94g
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Algebraic+Graph+Algorithms&rft.au=Erciyes%2C+K.&rft.atitle=Shortest+Paths&rft.series=Undergraduate+Topics+in+Computer+Science&rft.date=2021-01-01&rft.pub=Springer+International+Publishing&rft.isbn=9783030878856&rft.issn=1863-7310&rft.eissn=2197-1781&rft.spage=109&rft.epage=125&rft_id=info:doi/10.1007%2F978-3-030-87886-3_7
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F6809651-l.jpg