Shortest Path Problem under Bipolar Neutrosphic Setting

Abstract:

Article Preview

This main purpose of this paper is to develop an algorithm to find the shortest path on a network in which the weights of the edges are represented by bipolar neutrosophic numbers. Finally, a numerical example has been provided for illustrating the proposed approach.

Info:

Periodical:

Edited by:

Adrian Olaru

Pages:

59-66

DOI:

10.4028/www.scientific.net/AMM.859.59

Citation:

S. Broumi et al., "Shortest Path Problem under Bipolar Neutrosphic Setting", Applied Mechanics and Materials, Vol. 859, pp. 59-66, 2017

Online since:

December 2016

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.