Madan Natu

Works (1)

Updated: July 5th, 2023 16:04

1997 journal article

The point-to-point connection problem - analysis and algorithms

DISCRETE APPLIED MATHEMATICS, 78(1-3), 207–226.

By: M. Natu n & S. Fang n 

author keywords: algorithms; point-to-point connection problem; dynamic programming; computational complexity
TL;DR: This paper examines the structure of the problem with two source-destination pairs and provides an efficient implementation of a Dijkstra-like algorithm and conjecture that the same approach can be generalized for p source-Destination pairs with complexity O (n 3p + 2 ) where p is fixed. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2025) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.