Bellman-Ford algorithm for solving shortest path problem of a network under picture fuzzy environment

Parimala Mani, Broumi Said, Prakash Karthikeyan, TOPAL SELÇUK

Bellman-Ford algorithm for solving shortest path problem of a network under picture fuzzy environment

YAYIN ID:

7097464

KAPSAM AD:

Uluslararası

HAKEM TUR AD:

Hakemli

ENDEKS:

SCI-Expanded

MAKALE ADI:

Bellman-Ford algorithm for solving shortest path problem of a network under picture fuzzy environment

YAZAR ADI:

Parimala Mani, Broumi Said, Prakash Karthikeyan, TOPAL SELÇUK

DERGI ADI:

COMPLEX & INTELLIGENT SYSTEMS

YAYIN DILI ADI:

İngilizce

AY:

YIL:

2021

CILT:

SAYI:

ILK SAYFA:

2373

SON SAYFA:

2381

ISSN:

2199-4536

ERISIM TURU AD:

Elektronik

ALAN BILGISI:

Fen Bilimleri ve Matematik Temel Alanı>Matematik>Matematiğin Temelleri ve Matematiksel Mantık>Uygulamalı Matematik>network,graph theory,algortihm,fuzzy

YAZAR ID:

5562049

GUNCELLEME TARIHI:

2022-01-09 18:45:24

MAKALE TURU AD:

Özgün Makale

ERISIM LINKI:

http://dx.doi.org/10.1007/s40747-021-00430-w