Year: 1996
Type: article
Abstract: {Confirm* on reversedf*h*<vssery e n d identify by N o c k num ber) For communication networks that use shortest paths to route messages, alternate paths are needed when a communication link or node fails.Let an alternate path be a path that avoids a specified faulty link or node; the two algorithms in this paper, SEAP and SNAP, determine the shortest alternate paths between all pairs of nodes.For a directed graph G with m edges, n nodes, and nonnegative lengths 1(e) for each edge e, SEAP and SNAP each take 0(mn2 4-n3logn) time.SEAP and SNAP proceed in stages; in stage k, SEAP constructs shortest alternate paths for shortest paths with k edges and SNAP constructs shortest alternate paths for shortest paths with k intermediate nodes.The construction of shortest alternate paths uses a basic property of these paths: the shortest alternate path from u to w that avoids an edge e or a node z differs from the shortest path from u to w in only one subpath.
Author: Bevan Das
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2617440650
