The structure of electrical networks: A graph theory based analysis

International Journal of Critical Infrastructures

Volumn 5, Issue 3, 2009, Pages 265-284

  Atkins, Karla ^a   Chen, Jiangzhuo ^a   Kumar, V S Anil ^a   Marathe, Achla ^a  

^a VIRGINIA BIOINFORMATICS INSTITUTE   (United States)

Author keywords

Electrical infrastructure; Graph theory; Vulnerability

Indexed keywords

ELECTRIC NETWORK ANALYSIS; ELECTRIC NETWORK PARAMETERS; ELECTRIC POWER TRANSMISSION NETWORKS; NETWORK SECURITY; STRUCTURAL PROPERTIES;

COMPONENT SIZE; DEGREE DISTRIBUTIONS; ELECTRICAL INFRASTRUCTURE; ELECTRICAL NETWORKS; MINIMUM DOMINATING SET; NETWORK VULNERABILITY; RANDOM ATTACKS; VULNERABILITY;

GRAPH THEORY;

EID: 65849306397     PISSN: 14753219     EISSN: None     Source Type: Journal    
DOI: 10.1504/IJCIS.2009.024874     Document Type: Article

References (25)

1. Albert, R., Albert, I. and Nakarado, G.L. (2004) 'Structural vulnerability of the North American power grid', Physical Review E, Vol. 69, No. 2, 025103.
2. Amin, M. (2002) 'Modeling and control of complex interactive networks', IEEE Control Systems Magazine, Vol. 22, No. 1, pp. 22-27. (Pubitemid 34228792)
3. Amin, M. (2003) 'North America's electricity infrastructure: are we ready for more perfect storms?', IEEE Security and Privacy, Vol. 1, No. 5, pp. 19-25.
4. Arnborg, S., Corneil, D. and Proskurowski, A. (1987) 'Complexity of finding embed-dings in a k-tree', SIAM Journal of Algebraic and Discrete Methods, Vol. 8, pp. 277-284.
5. Barrett, C.L., Eubank, S. and Marathe, M.V. (2006) 'Modeling and simulation of large biological, information and socio-technical systems: an interaction based approach', in D. Goldin, S. Smolka and P. Wegner (Eds.) Interactive Computation: The New Paradigm, Springer Verlag.
6. Bodlaender, H.L. (1993) 'A tourist guide through treewidth', Acta Cybernetica, Vol. 11, Nos. 1-2, pp. 1-22.
7. Bodlaender, H.L. (1997) 'Treewidth: algorithmic techniques and results', in I. Pri-vara and P. Ruzicka (Eds.) Proceedings 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS'97, Lecture Notes in Computer Science, Berlin: Springer-Verlag, Vol. 1295, pp. 19-36. (Pubitemid 127114691)
8. Carreras, B.A., Lynch, V.E., Dobson, I. and Newman, D.E. (2002) 'Critical points and transitions in an electric power transmission model for cascading failure blackouts', Chaos, Vol. 12, No. 4, pp. 985-994. (Pubitemid 36046844)
9. Chen, J., Thorp, J.S. and Dobson, I. (2003) 'Cascading dynamics and mitigation assessment in power system disturbances via a hidden failure model', International Journal of Electrical Power and Energy Systems, Vol. 27, No. 4, pp. 318-326.
10. Cohen, E. (1996) 'Efficient parallel shortest-paths in digraphs with a separator decomposition', J. Algorithms, Vol. 21, No. 2, pp. 331-357. (Pubitemid 126412540)
11. EPRI (1999) 'Electricity technology roadmap: 1999 summary and synthesis', Technical Report CI-112677-V1, EPRI, Palo Alto, California, www.epri.com/corporate/discoverepriroadmap/.
12. Erdös, P. and Rényi, A. (1959) 'On random graphs I', Publ. Math. Debrecen, Vol. 6, pp. 290-297.
13. Even, G. (1999) 'Fast approximate graph partitioning algorithms', SIAM J. Com-put., Vol. 28, No. 6, pp. 2187-2214. (Pubitemid 30530997)
14. Gogate, V. and Dechter, R. (2004) 'A complete anytime algorithm for treewidth', Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence (UAI-04), Arlington, VA: AUAI Press, pp. 201-220.
15. Goldberg, A. (2007) 'Network optimization library', http://www.avglab. com/andrew/soft.html.
16. Haimes, Y.Y., Horowitz, B.M., Lambert, J.H., Santos, J., Lian, C. and Crowther, K. (2005) 'Inoperability input-output model for interdependent infrastructure sectors. I: theory and methodology', Journal of Infrastructure Systems, Vol. 11, No. 2, pp. 80-92.
17. Johnson, D.S. (1974) 'Approximation algorithms for combinatorial problems', Journal of Computer and System Sciences, Vol. 9, No. 3, pp. 256-278.
18. Kloks, T. and Bodlaender, H.L. (1992) 'Only few graphs have bounded treewidth', Technical Report RUU-CS-92-35, Institute of Information and Computing Sciences, Utrecht University.
19. Little, R.G. (2002) 'Controlling cascading failure: understanding the vulnerabilities of interconnected infrastructures', Journal of Urban Technology, Vol. 9, No. 1, pp. 109-123.
20. Mili, L., Qiu, Q. and Phadke, A.G. (2004) 'Risk assessment of catastrophic failures in electric power systems', Int. J. Critical Infrastructures, Vol. 1, No. 1, pp. 38-63.
21. Phadke, A.G. and Thorp, J.S. (1996) 'Expose hidden failures to prevent cascading outages', IEEE Computer Applications in Power, Vol. 9, No. 3, pp. 20-23.
22. Radhakrishnan, V., Hunt, H.B., III and Stearns, R.E. (1992) 'Efficient algorithms for solving systems of linear equations and path problems', Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Springer-Verlag, Vol. 577, pp. 109-119.
23. Telle, J.A. and Proskurowski, A. (1997) 'Algorithms for vertex partitioning problems on partial k-trees', SIAMJ. Discrete Math., Vol. 10, No. 4, pp. 529-550. (Pubitemid 127642991)
24. UWEE (1999) 'Power system test case archive', College of Engineering, University of Washington, http://www.ee.washington.edu/research/pstca/.
25. Vazirani, V. V. (2004) Approximation Algorithms, Springer.