๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient algorithm to find next-to-shortest path on

โœ Scribed by Sambhu Charan Barman; Sukumar Mondal; Madhumangal Pal

Book ID
107619862
Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
354 KB
Volume
31
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient algorithm for finding a pat
An efficient algorithm for finding a path subject to two additive constraints
โœ Turgay Korkmaz; Marwan Krunz; Spyros Tragoudas ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 616 KB

One of the key issues in providing end-to-end quality-of-service (QoS) guarantees in packet networks is how to determine a feasible path that satisยฎes a number of QoS constraints. For two or more additive constraints, the problem of ยฎnding a feasible path is NP-complete that cannot be exactly solved

An efficient algorithm to find optimal d
An efficient algorithm to find optimal double loop networks
โœ F. Aguilรณ; M.A. Fiol ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 527 KB

The problem of finding optimal diameter double loop networks with a fixed number of vertices has been widely studied. In this work, we give an algorithmic solution of the problem by using a geometrical approach. Given a fixed number of vertices n, the general problem is to find "steps" s 1 , s z e