Urmăriți
Talea Mohamed
Talea Mohamed
Université Hassan II de Casablanca
Adresă de e-mail confirmată pe univh2c.ma
Titlu
Citat de
Citat de
Anul
Single valued neutrosophic graphs
S Broumi, M Talea, A Bakali, F Smarandache
Journal of New theory, 86-101, 2016
3132016
Single valued neutrosophic graphs: degree, order and size
S Broumi, F Smarandache, M Talea, A Bakali
2016 IEEE international conference on fuzzy systems (FUZZ-IEEE), 2444-2451, 2016
2622016
Applying Dijkstra algorithm for solving neutrosophic shortest path problem
S Broumi, A Bakal, M Talea, F Smarandache, L Vladareanu
2016 International conference on advanced mechatronic systems (ICAMechS …, 2016
1782016
An introduction to bipolar single valued neutrosophic graph theory
S Broumi, F Smarandache, M Talea, A Bakali
Applied Mechanics and Materials 841, 184-191, 2016
1632016
Isolated single valued neutrosophic graphs
S Broumi, A Bakali, M Talea, F Smarandache
Infinite study, 2016
1242016
Interval valued neutrosophic graphs
S Broumi, M Talea, A Bakali, F Smarandache
Critical Review, XII 2016, 5-33, 2016
121*2016
Decision-making method based on the interval valued neutrosophic graph
S Broumi, M Talea, F Smarandache, A Bakali
2016 Future Technologies Conference (FTC), 44-50, 2016
1172016
Computation of shortest path problem in a network with SV-trapezoidal neutrosophic numbers
S Broumi, A Bakali, M Talea, F Smarandache, L Vladareanu
2016 International Conference on Advanced Mechatronic Systems (ICAMechS …, 2016
1032016
Shortest path problem under bipolar neutrosphic setting
S Broumi, A Bakali, M Talea, F Smarandache, M ALi
Applied Mechanics and Materials 859, 59-66, 2017
952017
Shortest path problem using Bellman algorithm under neutrosophic environment
S Broumi, A Dey, M Talea, A Bakali, F Smarandache, D Nagarajan, ...
Complex & intelligent systems 5, 409-416, 2019
912019
The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment
S Broumi, D Nagarajan, A Bakali, M Talea, F Smarandache, ...
Complex & Intelligent Systems 5, 391-402, 2019
702019
Novel SDN architecture for smart MPLS traffic engineering-DiffServ aware management
A Bahnasse, FE Louhab, HA Oulahyane, M Talea, A Bakali
Future Generation Computer Systems 87, 115-126, 2018
702018
Shortest path problem in fuzzy, intuitionistic fuzzy and neutrosophic environment: an overview
S Broumi, M Talea, A Bakali, F Smarandache, D Nagarajan, ...
Complex & Intelligent Systems 5, 371-378, 2019
682019
Shortest path problem under triangular fuzzy neutrosophic information
S Broumi, A Bakali, M Talea, F Smarandache, L Vladareanu
2016 10th International Conference on Software, Knowledge, Information …, 2016
562016
A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs
A Dey, S Broumi, LH Son, A Bakali, M Talea, F Smarandache
Granular Computing 4, 63-69, 2019
532019
Shortest path problem on single valued neutrosophic graphs
S Broumi, M Talea, A Bakali, F Smarandache, PKK Kumar
2017 international symposium on networks, computers and communications …, 2017
532017
Application of Dijkstra algorithm for solving interval valued neutrosophic shortest path problem
S Broumi, M Talea, A Bakali, F Smarandache
2016 IEEE symposium series on computational intelligence (SSCI), 1-6, 2016
532016
Bipolar complex neutrosophic sets and its application in decision making problem
S Broumi, A Bakali, M Talea, F Smarandache, PK Singh, V Uluçay, ...
Fuzzy Multi-criteria Decision-Making Using Neutrosophic Sets, 677-710, 2019
522019
Shortest path problem under interval valued neutrosophic setting
S Broumi, A Bakali, M Talea, F Smarandache, K Kishore, R Șahin
Infinite Study, 2016
502016
Uniform single valued neutrosophic graphs
S Broumi, A Dey, A Bakali, M Talea, F Smarandache, LH Son, D Koley
Infinite study, 2017
412017
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20