2002•International Journal of Computational Engineering ScienceRequires access

AN OPTIMAL ALGORITHM FOR SOLVING ALL-PAIRS SHORTEST PATHS ON TRAPEZOID GRAPHS

Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal

Open publisher page 30 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 30 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Shortest path problem, Euclidean shortest path, K shortest path routing, Floyd–Warshall algorithm, Mathematics, Algorithm, Longest path problem, Shortest Path Faster Algorithm

Back to paper search Browse research topics Original source

AN OPTIMAL ALGORITHM FOR SOLVING ALL-PAIRS SHORTEST PATHS ON TRAPEZOID GRAPHS — Research Paper | ScholarLens