|
Twitter
|
Facebook
|
Google+
|
VKontakte
|
LinkedIn
|
Viadeo
|
English
|
Français
|
Español
|
العربية
|
 
International Journal of Innovation and Applied Studies
ISSN: 2028-9324     CODEN: IJIABO     OCLC Number: 828807274     ZDB-ID: 2703985-7
 
 
Thursday 21 November 2024

About IJIAS

News

Submission

Downloads

Archives

Custom Search

Contact

  • Contact us
  • Newsletter:

Connect with IJIAS

  Now IJIAS is indexed in EBSCO, ResearchGate, ProQuest, Chemical Abstracts Service, Index Copernicus, IET Inspec Direct, Ulrichs Web, Google Scholar, CAS Abstracts, J-Gate, UDL Library, CiteSeerX, WorldCat, Scirus, Research Bible and getCited, etc.  
 
 
 

UN NOUVEL ALGORITHME POUR RESOUDRE LE PROBLEME DU FLOT FLOU MAXIMAL


Volume 21, Issue 3, October 2017, Pages 492–498

 UN NOUVEL ALGORITHME POUR RESOUDRE LE PROBLEME DU FLOT FLOU MAXIMAL

Fernand MAMANYA TAPASA1 and Rostin MABELA MAKENGO2

1 Université Pédagogique Nationale, Département de Mathématique et Informatique, RD Congo
2 Professeur, Université de Kinshasa, Département de Mathématique-Informatique, RD Congo

Original language: French

Copyright © 2017 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract


In this article, we first present a theory cadre about the fuzzy flow and we propose a variant of the algorithm of Ford and Fulkerson which permits to calculate the maximal fuzzy flow.

Author Keywords: maximal fuzzy flow, algorithm.


Abstract: (french)


Dans cet article, nous présentons d’abord un cadre théorique sur le flot flou et proposons une variante de l’algorithme de Ford et Fulkerson qui permet de calculer le flot flou maximal.

Author Keywords: flot flou maximal, algorithme.


How to Cite this Article


Fernand MAMANYA TAPASA and Rostin MABELA MAKENGO, “UN NOUVEL ALGORITHME POUR RESOUDRE LE PROBLEME DU FLOT FLOU MAXIMAL,” International Journal of Innovation and Applied Studies, vol. 21, no. 3, pp. 492–498, October 2017.