DocumentCode
529441
Title
Notice of Retraction
A simple solution to maximum flow of zero-flow edges
Author
Cui-xia Xu
Author_Institution
Dept. of Comput. & Commun., Weifang Univ., Weifang, China
Volume
1
fYear
2010
fDate
28-31 Aug. 2010
Firstpage
574
Lastpage
577
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 algorithm of maximum flow with more solve ways has been introduced. It can adjust maximum flow and feasible flow. The algorithm has double meanings: first, the maximum flow not only has saturated edges as many as possible, but also has edges as small as possible, namely more zero-flow edges. The algorithm uses depth-first search (DFS) to search, remove the improper vertex pairs, making the flowing path which can be adjusted to the least. It optimizes execute efficiency of algorithm to the utmost. The best nature is to understand and hold the algorithm easily. It can help teaching improvement and practice application. It is also worth popularization.
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 algorithm of maximum flow with more solve ways has been introduced. It can adjust maximum flow and feasible flow. The algorithm has double meanings: first, the maximum flow not only has saturated edges as many as possible, but also has edges as small as possible, namely more zero-flow edges. The algorithm uses depth-first search (DFS) to search, remove the improper vertex pairs, making the flowing path which can be adjusted to the least. It optimizes execute efficiency of algorithm to the utmost. 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
computer networks; flow graphs; optimisation; depth-first search; feasible flow; improper vertex pairs; maximum flow; teaching improvement; zero-flow edges; Algorithm design and analysis; Art; Complexity theory; Computers; Education; Materials; Mathematical model; depth-first search(DFS); labeled digraph; maximum flow; saturated edge; zero-flow edge;
fLanguage
English
Publisher
ieee
Conference_Titel
Geoscience and Remote Sensing (IITA-GRS), 2010 Second IITA International Conference on
Conference_Location
Qingdao
Print_ISBN
978-1-4244-8514-7
Type
conf
DOI
10.1109/IITA-GRS.2010.5602698
Filename
5602698
Link To Document