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

From MaRDI portal
Publication:1034978

DOI10.1007/s12190-008-0218-1zbMath1194.68267OpenAlexW2116091862MaRDI QIDQ1034978

Madhumangal Pal, Sambhu Charan Barman, Sukumar Mondal

Publication date: 9 November 2009

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-008-0218-1




Related Items (5)




Cites Work




This page was built for publication: An efficient algorithm to find next-to-shortest path on permutation graphs