Work

Path Through Specified Nodes and Links in a Network

Year: 2024

Type: article

Abstract: A constrained shortest route problem in graph theory is about determination of a shortest path between two given nodes of the network that also visits a given set of specified nodes or a set of specified links before arriving to the destination. These earlier approaches did not consider specified elements containing both nodes and links of the given network. This paper finds a shortest path joining the origin node to the destination node, which is constrained to pass through a set of ‘K’ specified elements of the given network, where K1 number of elements represent nodes, 0

Source: Journal of Graphic Era University

DOI: 10.13052/jgeu0975-1416.1225

Authors: Santosh Kumar OAM, Elias Munapo, Philimon Nyamugure, Trust Tawanda

Institutions: RMIT University, North-West University, National University of Science and Technology

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4402749819

FWCI:

Cites:

Cited by:

Related to: 10