Please use this identifier to cite or link to this item:
Title: A Sequential Algorithm to Solve Next-to-Shortest Path Problem on Circular-arc Graphs
Authors: Pal, Madhumangal
Mandal, Swagata
Keywords: Design and analysis of algorithms
Shortest paths
Next shortest paths
Circular-arc graph
Issue Date: 2006
Publisher: Vidyasagar University , Midnapore , West-Bengal , India
Series/Report no.: Journal of Physical Science;Vol 10 [2006]
Abstract: In this article, we study the problem of finding the next-to-shortest path in circular-arc graph. A next-to-shortest path between any pair of vertices in a shortest path amongst all paths between those vertices with length strictly greater than the length of the shortest path. The next-to-shortest path problem in a directed graph in NP-hard. Here we deigned a polynomial time algorithm to solve this problem for the circular-arc graph.
Description: 201-217
ISSN: 0972-8791 (Print)
Appears in Collections:Journal of Physical Sciences Vol.10 [2006]
Publication ( Madhumangal Pal )

Files in This Item:
File Description SizeFormat 
JPS10art19.pdf945.5 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.