Cart (Loading....) | Create Account
Close category search window
 

Research on the Maximum Flow in Large-scale Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Yan-ping Zhang ; Sch. of Comput. Sci. & Technol., Anhui Univ., Hefei, China ; Bo Hua ; Juan Jiang ; Yuan Zhang
more authors

This article covers a problem that often arises in real life situations-the maximum flow problem. This problem is a classical combinatorial optimization problem, which arises in many engineering and scientific applications. It is also the important content of computer science and operational research. In order to reduce computational complexity, many improvement methods have been proposed. In this paper, applying the thought of granular computing and combining the maximal clique, a new method is proposed to solve the approximately maximum flow problem in complex and large-scale network. By contracting the appropriate maximal clique in the network, we can calculate approximate maximum flow much more efficiently. Experimental results demonstrate that the algorithm we proposed can be used to compute approximate maximum flow in a relatively short period of time and also provide a new approach to the study on the maximum flow problem.

Published in:

Computational Intelligence and Security (CIS), 2011 Seventh International Conference on

Date of Conference:

3-4 Dec. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.