Title :
Notice of Retraction
A Simple Solution to Maximum Flow Based on DFS
Author_Institution :
Dept. of Comput. & Commun., Weifang Univ., Weifang, China
Abstract :
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
The traditional algorithms concerning the maximum flow are based on the augmenting-path theorem, but the concept and theorem of the augmenting-path are rather abstract and difficult to understand and master, therefore, it somehow limits the application of the maximum flow algorithms. As a result, this paper introduces a simple algorithm of maximum flow. It first uses depth-first search (DFS) to find maximum flow in stead of augmenting-path method. The best nature is to understand and hold the algorithm easily. It can help teaching improvement and practice application. It is also worth popularization.
Keywords :
tree searching; augmenting-path theorem; depth-first search; maximum flow algorithms; Application software; Computer networks; Computer science; Computer science education; Educational technology; Mathematical model; Petroleum; Pipelines; Power system modeling; Road transportation; augmenting-path; depth-first search(DFS); labeled digraph; maximum flow;
Conference_Titel :
Education Technology and Computer Science (ETCS), 2010 Second International Workshop on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-6388-6
DOI :
10.1109/ETCS.2010.351
