DocumentCode
3454151
Title
Research on the Maximum Flow Problem with Multiple Solutions
Author
Xu, Cui-xia
Author_Institution
Dept. of Comput. & Commun., Weifang Univ., Weifang, China
fYear
2010
fDate
27-28 Nov. 2010
Firstpage
1
Lastpage
4
Abstract
his paper introduces multiple solutions to maximum flow and presents a simple approach to work out some special maximum flows. The result by the algorithm has double meanings: that is to say, 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. As a result, it can optimize execute efficiency of algorithm to the utmost. It is also worth popularization.
Keywords
network theory (graphs); tree searching; depth first search; maximum flow problem; multiple solution; optimization algorithm; saturated edge; zero flow edge; Algorithm design and analysis; Arrays; Communication networks; Complexity theory; Computers; Materials; Mathematical model;
fLanguage
English
Publisher
ieee
Conference_Titel
Database Technology and Applications (DBTA), 2010 2nd International Workshop on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-6975-8
Electronic_ISBN
978-1-4244-6977-2
Type
conf
DOI
10.1109/DBTA.2010.5659068
Filename
5659068
Link To Document