Relevant bibliographies by topics / And Ford and Fulkerson algorithm

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'And Ford and Fulkerson algorithm'

Author: Grafiati
Published: 4 June 2025
Last updated: 1 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'And Ford and Fulkerson algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "And Ford and Fulkerson algorithm"

1

Chaibou, Amadou, Ousmane Moussa Tessa, and Oumarou Sié. "Modeling the Parallelization of the Edmonds-Karp Algorithm and Application." Computer and Information Science 12, no. 3 (2019): 81. http://dx.doi.org/10.5539/cis.v12n3p81.

Full text
Abstract:
Many optimization problems can be reduced to the maximum flow problem in a network. However, the maximum flow problem is equivalent to the problem of the minimum cut, as shown by Fulkerson and Ford (Fulkerson & Ford, 1956). There are several algorithms of the graph’s cut, such as the Ford-Fulkerson algorithm (Ford & Fulkerson, 1962), the Edmonds-Karp algorithm (Edmonds & Karp, 1972) or the Goldberg-Tarjan algorithm (Goldberg & Tarjan, 1988). In this paper, we study the parallel computation of the Edmonds-Karp algorithm which is an optimized version of
APA, Harvard, Vancouver, ISO, and other styles
2

Dumlao, Menchita F., Jayvee Ryan F. Banal, and Arriane E. Livara. "Gap Analysis of Ford-Fulkerson Algorithm and Edmonds-Karp Algorithm as Machine Learning Approach for Augmentation Path in the Maximum Flow Problem." International Journal in Information Technology in Governance, Education and Business 3, no. 1 (2021): 30–35. http://dx.doi.org/10.32664/ijitgeb.v3i1.83.

Full text
Abstract:
The maximum flow problem is popular with many researchers as it plays a significant role in many areas. This problem is about obtaining the maximum flow where there is one source and sink in the network flow. In solving maximum flow problems, many algorithms are applied such as the most used are the Ford-Fulkerson Algorithm and the Edmonds-Karp Algorithm. The goal of this study is to identify the gaps of these two algorithms and sufficiently provide an analysis and comparison of their time complexity, simplicity, and effectiveness to solve the augmentation path in the maximum flow problem. The
APA, Harvard, Vancouver, ISO, and other styles
3

Wagner, Donald K. "Graphs with no K3,3 Minor Containing a Fixed Edge." International Journal of Combinatorics 2013 (March 20, 2013): 1–7. http://dx.doi.org/10.1155/2013/783710.

Full text
Abstract:
It is well known that every cycle of a graph must intersect every cut in an even number of edges. For planar graphs, Ford and Fulkerson proved that, for any edge e, there exists a cycle containing e that intersects every minimal cut containing e in exactly two edges. The main result of this paper generalizes this result to any nonplanar graph G provided G does not have a K3,3 minor containing the given edge e. Ford and Fulkerson used their result to provide an efficient algorithm for solving the maximum-flow problem on planar graphs. As a corollary to the main result of this paper, it is shown
APA, Harvard, Vancouver, ISO, and other styles
4

Haftom, Gebreanenya. "Maximum Flow Problem in Ethiopian Airlines." Journal of Progressive Research in Mathematics 9, no. 2 (2016): 1371–80. https://doi.org/10.5281/zenodo.3976734.

Full text
Abstract:
Maximum flow problem is a problem which involves a directed network with arcs carrying flow. The problem is to find the maximum flow that can be sent through the arcs of the network from some specified node S, called the source, to a second specified node T, called the sink. In this paper we are going to see what maximum flow problem is and its solution algorithm called the Ford and Fulkerson algorithm. This paper also contains a problem of maximum flow problem in Ethiopian Airlines solved using the Ford and Fulkerson algorithm.
APA, Harvard, Vancouver, ISO, and other styles
5

Bulut, Merve, and Evrencan Özcan. "Optimization of electricity transmission by Ford–Fulkerson algorithm." Sustainable Energy, Grids and Networks 28 (December 2021): 100544. http://dx.doi.org/10.1016/j.segan.2021.100544.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yiltas-Kaplan, Derya. "Traffic Optimization with Software-Defined Network Controller on a New User Interface." JUCS - Journal of Universal Computer Science 28, no. (6) (2022): 648–69. https://doi.org/10.3897/jucs.80625.

Full text
Abstract:
Software-defined networking (SDN) has emerged as a solution to the cumbersome structures of classical computer networks. It separates control and data planes to give independence to devices with respect to either traffic routing or network management. The two isolated planes communicate with each other via the help of software modules, which are located in an SDN controller, such as Floodlight, NOX, or Ryu. In this study, Floodlight is used and an SDN topology with 20 switches is constructed with Python code in Mininet. All algorithms have been coded with Java. The default routing algorithm in
APA, Harvard, Vancouver, ISO, and other styles
7

Ibrahim, Iman Youssif, and Ibrahim M. I. Zebari. "A Comprehensive Review of the Ford-fulkerson Algorithm for Network Flow Problems." Asian Journal of Research in Computer Science 18, no. 3 (2025): 335–44. https://doi.org/10.9734/ajrcos/2025/v18i3597.

Full text
Abstract:
The Ford-Fulkerson method is one of the basic algorithms for computing the maximum flow in a flow network. This identifies more frequent traversed paths as a means of maximizing the flow between a source node and a downstream node in a directed network. Therefore, this paper will present a literature review, the principles of the algorithm, its mathematical foundation, applications and improvements made to the algorithm, such as the use of breadth-first search (BFS) as in the Edmonds-Karp algorithm, parallel computing techniques and predictive modeling to enhance efficiency. However, the algor
APA, Harvard, Vancouver, ISO, and other styles
8

Akhmediyarova, Ainur, Dinara Kassymova, Anar Utegenova, and Irbulat Utepbergenov. "Development and research of the algorithm for determining the maximum flow at distribution in the network." Open Computer Science 6, no. 1 (2016): 213–18. http://dx.doi.org/10.1515/comp-2016-0017.

Full text
Abstract:
AbstractAn upgraded version of Ford-Fulkerson algorithm is proposed, which allows to determine the maximum flow and the distribution flow in branches of the network. Results of simulation using this algorithm are given. They show its effectiveness in comparison with the other variants of flow distribution in the network at change of the capacity of branches randomly in time.
APA, Harvard, Vancouver, ISO, and other styles
9

Shin, Kwang, and Steve Corder. "Implementing the ford-fulkerson labeling algorithm with fixed-order scanning." Computers & Operations Research 19, no. 8 (1992): 783–87. http://dx.doi.org/10.1016/0305-0548(92)90017-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Masadeh, Raja, Abdullah Alzaqebah, Bushra Smadi, and Esra Masadeh. "Parallel Whale Optimization Algorithm for Maximum Flow Problem." Modern Applied Science 14, no. 3 (2020): 30. http://dx.doi.org/10.5539/mas.v14n3p30.

Full text
Abstract:
Maximum Flow Problem (MFP) is considered as one of several famous problems in directed graphs. Many researchers studied MFP and its applications to solve problems using different techniques. One of the most popular algorithms that are employed to solve MFP is Ford-Fulkerson algorithm. However, this algorithm has long run time when it comes to application with large data size. For this reason, this study presents a parallel whale optimization (PWO) algorithm to get maximum flow in a weighted directed graph. The PWO algorithm is implemented and tested on datasets with different sizes. The PWO al
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "And Ford and Fulkerson algorithm"

1

Mützell, Martin, and Markus Josefsson. "Max Flow Algorithms : Ford-Fulkerson, Edmond-Karp, Goldberg-TarjanComparison in regards to practical running time on different types of randomized flow networks." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-168027.

Full text
Abstract:
The original algorithm proposed by Ford and Fulkerson to solve the maximum flow problem is still in use but is far from the only alternative. This paper introduces that algorithm as well as the similar Edmond-Karp and the more modern Goldberg-Tarjan. Ford-Fulkerson uses depth-first-searches to find augmenting paths through a residual graph. Edmond-Karp instead uses breath-first-searches to achieve a polynomial time complexity. Goldberg-Tarjan solves the problem by gradually pushing flow through the residual graph.  A comparison on randomized graphs where the size, graph density and the maximum
APA, Harvard, Vancouver, ISO, and other styles
2

Arangoitia, Fernández Baca Jorge Víctor. "Análisis, diseño e implementación de un software que determine la solución al problema del flujo máximo aplicando el algoritmo de Ford-Fulkerson." Bachelor's thesis, Pontificia Universidad Católica del Perú, 2013. http://tesis.pucp.edu.pe/repositorio/handle/123456789/4538.

Full text
Abstract:
El presente proyecto de fin carrera esboza una solución informática al problema del flujo máximo, para lo cual se ha optado por utilizar el algoritmo de Ford-Fulkerson, al ser este el más conocido y difundido, y que permite llegar a una solución exacta del problema en un tiempo relativamente corto. Dicho problema tiene una amplia gama de aplicaciones, que van desde cálculo de rutas disjuntas para redes de comunicaciones, circulación con capacidad, programación de líneas aéreas, selección de proyectos, entre otras. El problema del flujo máximo fundamentalmente consiste en: dado una red (
APA, Harvard, Vancouver, ISO, and other styles
3

Ramírez, Rafael Dina América Anita. "Design and validation of an algorithm for recognition a stop gesture." Master's thesis, Pontificia Universidad Católica del Perú, 2021. http://hdl.handle.net/20.500.12404/18977.

Full text
Abstract:
In the purpose of connecting humans with machines, di erent techniques have been developed. Human interactions can be interpreted in di erent ways and di erent techniques can be used to read them. Several dissimilar approaches are possible for communication, some of them require additional hardware. In noisy environments, it is important to acquire the information with the noise ltered in order not to a ect the important data. For this function, a device that provides data through image processing is required. The proposed method conducts an analysis of human body angles a ected while
APA, Harvard, Vancouver, ISO, and other styles
4

Бережная, Ольга Владимировна, Ольга Володимирівна Бережна, Olha Volodymyrivna Berezhna та А. В. Сливченко. "Сравнительный анализ алгоритмов Беллмана-Форда и алгоритма Дейкстры". Thesis, Видавництво СумДУ, 2010. http://essuir.sumdu.edu.ua/handle/123456789/4008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yarmolskyy, Oleksandr. "Využití distribuovaných a stochastických algoritmů v síti." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2018. http://www.nusl.cz/ntk/nusl-370918.

Full text
Abstract:
This thesis deals with the distributed and stochastic algorithms including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Furthermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in Matlab.
APA, Harvard, Vancouver, ISO, and other styles
6

Stráník, František. "Teorie grafů - implementace vybraných problémů." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218082.

Full text
Abstract:
This work is intended on identification with basic problems from the graphs theory area. There are the basic conceptions as well more complicated problems described. The one part of this work is specialized in working of individual types of graphs. It starts with single linked list through double linked list after as much as trees which represented the simplest graphs textures. The other part of this work devotes to the whole graph and describes more complicated problems and their resolution from the theory graphs area. Among these problems belongs to searching in graphs help by Depth First Se
APA, Harvard, Vancouver, ISO, and other styles
7

Fernández, Asencios Nery Benjamín. "Diseño de un Sistema de Criptografía Asimétrica para dotar Seguridad de Confidencialidad e Integridad a las Comunicaciones SMTP y SFTP para Scharff Logística Integrada S.A." Bachelor's thesis, Universidad Peruana de Ciencias Aplicadas (UPC), 2021. http://hdl.handle.net/10757/656271.

Full text
Abstract:
El correo electrónico se ha convertido en uno de los métodos de comunicación más importantes para cualquier persona y organización. Sin embargo, los estándares actuales de la industria no ponen énfasis en la seguridad del correo electrónico. Los correos electrónicos pueden ser interceptados fácilmente por otros. Potencialmente, cada correo electrónico no cifrado enviado a través de una red o almacenado en un servidor de correo electrónico puede leerse, copiarse o modificarse. Existe una gran necesidad de entrega segura de correo electrónico. Algunos proveedores de servicios de correo elect
APA, Harvard, Vancouver, ISO, and other styles
8

Olivera, Taboada Luis Angel, Puelles Melissa Aurora Sialer, and Gonzales Juan José Velarde. "Aplicación de Data Science para el análisis de una campaña de respuesta directa televisiva de UNICEF Perú." Bachelor's thesis, Universidad Peruana de Ciencias Aplicadas (UPC), 2020. http://hdl.handle.net/10757/655986.

Full text
Abstract:
El presente trabajo de investigación abordó una novedosa campaña televisiva desplegada por UNICEF Perú, para fomentar la afiliación de donantes a su programa Soy Socio, en beneficio de niños y niñas en situación de vulnerabilidad. A partir de la información de la primera campaña de promoción televisiva, se extrajeron diversos insights, gracias a la aplicación de herramientas y técnicas de ciencia de datos, para analizar sus principales resultados y evaluar el performance del proveedor de atención telefónica, como la contribución de los grupos televisivos contratados. De este modo, se busc
APA, Harvard, Vancouver, ISO, and other styles
9

Chevalier, Jérémie. "Optimisation des routes de départ et d'arrivée aux approches des grands aéroports." Thesis, Toulouse 3, 2020. http://www.theses.fr/2020TOU30092.

Full text
Abstract:
Les TMAs (Terminal Maneuvering Areas) sont aujourd'hui un goulot d'étranglement de l'espace aérien, dans lequel les avions quittent leur phase de croisière pour atterrir à un aéroport, ou au contraire effectuent leur montée pour rejoindre leur route de croisière. Afin d'éviter la congestion de ces zones, il est nécessaire de construire des routes de départ et d'arrivée efficaces. Dans ce travail, une solution pour la création de routes de départ et d'arrivée est proposée, prenant en compte la configuration des pistes, les environs de l'aéroport, ainsi qu'un ensemble de contraintes opérationnel
APA, Harvard, Vancouver, ISO, and other styles
10

Flores, Mori Jean Arnold Nurff, and Gonzales Jose Antonio Violeta. "Propuesta de automatización del proceso de emisión de seguros de salud para una empresa aseguradora usando software RPA y un motor de asignación." Bachelor's thesis, Universidad Peruana de Ciencias Aplicadas (UPC), 2021. http://hdl.handle.net/10757/657616.

Full text
Abstract:
Este proyecto se centra en el estudio de la empresa “Pacifico Seguros” que opera principalmente en el sector de seguros. El desarrollo del trabajo está enfocado en el subproceso de “Emisión” que es uno de los procesos importantes de la empresa porque acá se inicia todo el proceso de las emisiones de los clientes para las afiliaciones de sus trabajadores. La oportunidad de mejora se presenta en la mayoría de actividades del subproceso de “Emisión” que suelen ser repetitivas y operativas; y en su mayoría son ejecutadas de forma manual. Por tal motivo, el proyecto contempla una solución para
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "And Ford and Fulkerson algorithm"

1

Looker, K. W. Final report of a 1987 Ford Escort into a 50% left offset barrier in support of CRASH3 damage algorithm reformulation. National Highway Traffic Safety Administration, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Looker, K. W. Final report of a 1987 Ford Taurus into a 30.5 cm diameter pole barrier in support of Crash3 damage algorithm reformulation. National Highway Traffic Safety Administration, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Looker, K. W. Final report of a 1990 Ford Taurus into heavy truck rigid rear underride guard in support of CRASH3 damage algorithm reformulation. National Highway Traffic Safety Administration, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

El-Habash, N. A. Final report of frontal barrier impacts of a 1985 Ford Escort 3-door hatchback in support of Crash III damage algorithm reformation. U.S. Dept. of Transportation, National Highway Traffic Safety Administration, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

El-Habash, N. A. Final report of frontal barrier impacts of a 1986 Ford Taurus 4-door sedan in support of Crash III damage algorithm reformation. U.S. Dept. of Transportation, National Highway Traffic Safety Administration, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Looker, K. W. Final report of a non-deformable crabbed impactor into a 1988 Ford Taurus 4-door sedan in support of CRASH3 damage algorithm reformulation. National Highway Traffic Safety Administration, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Markusic, C. A. Final report of 270 moving pole barrier impact into a 1986 Ford Escort 3-door hatchback in support of Crash III damage algorithm reformulation. U.S. Dept. of Transportation, National Highway Traffic Safety Administration, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

United States. National Highway Traffic Safety Administration. and Vehicle Research and Test Center (U.S.), eds. Final report of 339 contoured moving barrier impact into a 1985 Ford Escort 3-door hatchback in support of Crash III damage algorithm reformation. National Highway Traffic Safety Administration, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

El-Habash, N. A. Final report of 270©® contoured moving barrier impact into a 1983 Ford Tempo 4-door sedan in support of Crash III damage algorithm reformation. U.S. Dept. of Transportation, National Highway Traffic Safety Administration, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Markusic, C. A. Final report of 339©® contoured moving barrier impact into a 1985 Ford Escort 3-door hatchback in support of Crash III damage algorithm reformation. National Highway Traffic Safety Administration, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "And Ford and Fulkerson algorithm"

1

Devi, R., and V. Gopalakrishnan. "Up-Link/Down-Link Availability Calculation in Cloud Using Ford Fulkerson Algorithm." In Communications in Computer and Information Science. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-15556-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sharko, Marharyta, Vira Fomishyna, Olha Liubchuk, Natalia Petrushenko, Tetiana Yakymchuk, and Liliia Chaika-Petehyrych. "Combinatorics of the Ford-Fulkerson Algorithm to Reduce the Risks of the COVID-19 Pandemic in International Tourism." In Advances in Computer Science for Engineering and Education IV. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80472-5_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Broumi, Said, Mohamed Talea, Assia Bakali, Florentin Smarandache, and Santanu Kumar Patro. "On the Neutrosophic Counterpart of Bellman-Ford Algorithm." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-36677-3_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cavendish, D., and M. Gerla. "Internet QoS Routing using the Bellman-Ford Algorithm." In High Performance Networking. Springer US, 1998. http://dx.doi.org/10.1007/978-0-387-35388-3_37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jeong, In-Kyu, Jia Uddin, Myeongsu Kang, Cheol-Hong Kim, and Jong-Myon Kim. "Accelerating a Bellman–Ford Routing Algorithm Using GPU." In Lecture Notes in Electrical Engineering. Springer Netherlands, 2014. http://dx.doi.org/10.1007/978-94-017-8798-7_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Safari, Mohsen, Wytse Oortwijn, and Marieke Huisman. "Automated Verification of the Parallel Bellman–Ford Algorithm." In Static Analysis. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-88806-0_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Broumi, Said, Deivanayagampillai Nagarajan, Malayalan Lathamaheswari, Mohamed Talea, Assia Bakali, and Florentin Smarandache. "Bellman-Ford Algorithm Under Trapezoidal Interval Valued Neutrosophic Environment." In Communications in Computer and Information Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36368-0_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Neha and Akhil Kaushik. "Extended Bellman Ford Algorithm with Optimized Time of Computation." In Advances in Intelligent Systems and Computing. Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-0135-2_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Devi Boddu, Rama, K. Kishan Rao, and M. Asha Rani. "Performance Analysis of Modified Bellman Ford Algorithm Using Cooperative Relays." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-13731-5_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Vezolainen, Alexei, Alexey Salnikov, Artem Klyuchikov, and Sergey Komech. "Fast Parallel Bellman-Ford-Moore Algorithm Implementation for Small Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-22941-1_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "And Ford and Fulkerson algorithm"

1

Miroshnikov, Artem, Yuri V. Lubenets, and Dmitrij Kashirin. "Interval Modification of Ford-Fulkerson Algorithm in Solving the Problem of Finding the Maximum Flow." In 2024 6th International Conference on Control Systems, Mathematical Modeling, Automation and Energy Efficiency (SUMMA). IEEE, 2024. https://doi.org/10.1109/summa64428.2024.10803845.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Karthikeyan, M., Satheeshkumar Sekar, H. Anwer Basha, P. Epsiba, E. N. Ganesh, and B. Meenakshi. "Dijkstra’s Algorithm with Bellman-Ford for Shortest Path Discovery in Big Data." In 2024 2nd International Conference on Self Sustainable Artificial Intelligence Systems (ICSSAS). IEEE, 2024. https://doi.org/10.1109/icssas64001.2024.10760521.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bai, Ruipeng, Hui Guo, Zhenzhong Wang, Yanlong Zhang, Fan Zhang, and Lei Chen. "FPGA Interconnect Resources Test Based on A Improved Ford-Fulkerson Algorithm." In 2018 IEEE 4th Information Technology and Mechatronics Engineering Conference (ITOEC). IEEE, 2018. http://dx.doi.org/10.1109/itoec.2018.8740549.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Marpaung, Faridawaty, Arnita, and Nila Sari. "Transportation network system analysis using Ford-Fulkerson algorithm in Medan city." In THE 8TH ANNUAL INTERNATIONAL SEMINAR ON TRENDS IN SCIENCE AND SCIENCE EDUCATION (AISTSSE) 2021. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0129145.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Manganaris, Kyriakos N., Fotis I. Lazarakis, and Kostas P. Peppas. "Using Fulkerson-Ford Algorithm for UE - AP Association in mmWave Cellular Networks." In 2023 12th International Conference on Modern Circuits and Systems Technologies (MOCAST). IEEE, 2023. http://dx.doi.org/10.1109/mocast57943.2023.10176785.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Neto, Euclides Pinto, and Gustavo Callou. "An Approach Based on Ford-Fulkerson Algorithm to Optimize Network Bandwidth Usage." In 2015 Brazilian Symposium on Computing Systems Engineering (SBESC). IEEE, 2015. http://dx.doi.org/10.1109/sbesc.2015.21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kisku, Dakshina Ranjan, Debanjan Chatterjee, S. Trivedy, and Massimo Tistarelli. "Face image abstraction by Ford-Fulkerson algorithm and invariant feature descriptor for human identification." In 2014 International Carnahan Conference on Security Technology (ICCST). IEEE, 2014. http://dx.doi.org/10.1109/ccst.2014.6987037.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hong, Zihan, Dongyang Xi, Kaixiang Zhang, and Tingting Yan. "Research on the Water Level Optimization of the Great Lakes Based on Ford-Fulkerson Algorithm." In CAIBDA 2024: 2024 4th International Conference on Artificial Intelligence, Big Data and Algorithms. ACM, 2024. http://dx.doi.org/10.1145/3690407.3690544.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sqalli, Mohammed Tahri, and Dena Al-Thani. "Road Ahead Closed! What To Do? An Application of Ford Fulkerson’s Network Flow Algorithm on Education City." In 2022 International Conference on Electrical, Computer and Energy Technologies (ICECET). IEEE, 2022. http://dx.doi.org/10.1109/icecet55527.2022.9873500.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Wei, Hao Chen, Chong Jiang, and Lin Zhu. "Improvement And Experimental Evaluation Bellman-Ford Algorithm." In 2013 International Conference on Advanced ICT. Atlantis Press, 2013. http://dx.doi.org/10.2991/icaicte.2013.29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'And Ford and Fulkerson algorithm' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography