A Sequential Algorithm to Solve Next-to-Shortest Path Problem on Circular-arc Graphs

Please use this identifier to cite or link to this item: https://ir.vidyasagar.ac.in/jspui/handle/123456789/717

Full metadata record

DC Field	Value	Language
dc.contributor.author	Pal, Madhumangal
dc.contributor.author	Mandal, Swagata
dc.date.accessioned	2016-12-22T17:00:59Z	-
dc.date.available	2016-12-22T17:00:59Z	-
dc.date.issued	2006
dc.identifier.issn	0972-8791 (Print)
dc.identifier.uri	http://inet.vidyasagar.ac.in:8080/jspui/handle/123456789/717	-
dc.description	201-217	en_US
dc.description.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.	en_US
dc.language.iso	en_US	en_US
dc.publisher	Vidyasagar University , Midnapore , West-Bengal , India	en_US
dc.relation.ispartofseries	Journal of Physical Science;Vol 10 [2006]
dc.subject	Design and analysis of algorithms	en_US
dc.subject	Shortest paths	en_US
dc.subject	Next shortest paths	en_US
dc.subject	Circular-arc graph	en_US
dc.title	A Sequential Algorithm to Solve Next-to-Shortest Path Problem on Circular-arc Graphs	en_US
dc.type	Article	en_US
Appears in Collections:	Journal of Physical Sciences Vol.10 [2006] Publication ( Madhumangal Pal )

Files in This Item:

File	Description	Size	Format
JPS10art19.pdf		945.5 kB	Adobe PDF	View/Open