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

Using Quantum Search to Solve Dynamic Maximum Network Flow Problem

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

4 Author(s)
Chi-Yuan Chen ; Dept. of Electr. Eng., Nat. Dong Hwa Univ., Hualien, Taiwan ; Yu-Chuan Lin ; Yao-Hsin Chou ; Han-Chieh Chao

This paper proposes a quantum search based algorithm to improve the dynamic maximum network flow problem. First, we convert the time-dependent process into time-independent process. Second, we use the draining algorithm to find out the maximum flow and compare with classical algorithms. Third, the draining algorithm is speed up by utilizing quantum search. Finally, we also provide the analysis of time complexity.

Published in:

Parallel and Distributed Processing with Applications (ISPA), 2011 IEEE 9th International Symposium on

Date of Conference:

26-28 May 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.