By Topic

On limits to the graph-theoretic approaches in the electric power systems

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

2 Author(s)
Cvijic, S. ; Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA ; Ilic, M.

There have been numerous attempts to use graph-theoretic algorithms in power systems. But it has not been clear enough what the potentials and the limitations of these applications are. The goal of our work is to model differences between transportation and electrical networks and to provide a uniform way for transforming an electrical network into its transportation equivalent. The limitations of the application of graph algorithms are discussed based on this transformation. After obtaining a transportation equivalent of an electrical network, two famous graph algorithms: Max-Flow and Min-Cost Flow are executed in a tree representation.

Published in:

North American Power Symposium (NAPS), 2011

Date of Conference:

4-6 Aug. 2011