Power domination problem in graphs

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 818-828

  Liao, Chung Shou ^a,b   Lee, Der Tsai ^a,b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ELECTRIC POWER SYSTEMS; CLUSTERING ALGORITHMS; COMBINATORIAL MATHEMATICS; GRAPHIC METHODS; MONITORING; PHASOR MEASUREMENT UNITS; UNITS OF MEASUREMENT;

PHASE MEASUREMENT UNITS (PMU); POWER DOMINATING SET (PDS); POWER DOMINATION PROBLEM; ASYMPTOTICALLY OPTIMAL; DOMINATION NUMBER; DOMINATION PROBLEM; LINEAR-TIME ALGORITHMS; POWER DOMINATING SETS; PROPER CIRCULAR-ARC GRAPHS; VERTEX COVER PROBLEMS;

GRAPH THEORY;

EID: 26844441516     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_83     Document Type: Conference Paper

References (15)

1. T. L. Baldwin, L. Mili, M. B. Boisen, Jr., and R. Adapa, Power system observability with minimal phasor measurement placewement, IEEE Trans. Power Syst. Vol. 8, No. 2, May 1993, 707-715.
2. M. Ben-Or, Lower bounds for algebraic computation trees, Proc. 15th Annual Symp. on theory of Computing, 1983, pp. 80-86.
3. G. J. Chang, Algorithmic aspects of domination in graphs, in: Handbook of Combinatorial Optimization (D.-Z. Du and P. M. Pardalos eds.) Vol. 3 (1998) 339-405.
4. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, Inc (1980).
5. T. W. Haynes, S. M. Hedetniemi, S. T. Hedetniemi, and M. A. Henning, Domination in graphs applied to electric power networks, SIAM J. Discrete Math. Vol. 15, No. 4, (2002) 519-529.
6. T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Domination in Graphs: The Theory, Marcel Dekker, Inc. New York (1998).
7. T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Domination in Graphs: Advanced Topics, Marcel Dekker, Inc. New York (1998).
8. Wen-Lian Hsu, and Kuo-Hui Tsai, Linear time algorithms on circular-arc graphs, Infrom. Process. Letter., Vol. 40, (1991) 123-129.
9. C. S. Liao and G. J. Chang, Algorithmic aspect of k-tuple domination in graphs, Taiwanese J. Math. 6 (2002) 415-420.
10. C. S. Liao and G. J. Chang, k-tuple domination in graphs, Inform. Process. Letter., Vol. 87, (2003) 45-50.
11. C. S. Liao and D. T. Lee, Power domination problem in graphs, manuscript, Institute of Information Science, Academia Sinica, April 2005.
12. D. T. Lee, M. Sarrafzadeh, and Y. F. Wu, Minimum cuts for circular-arc graphs, SIAM J. Comput., Vol. 19, No. 6, (1990) 1041-1050.
13. G. Ramalingam and C. Pandu Rangan, A unified approach to domination problems in interval graphs, Inform. Process. Letter., Vol. 27, (1988) 271-274.
14. K. H. Tsai anad D. T. Lee, k-Best Cuts for Circular-Arc Graphs, Algorithmica, Vol. 18, (1997) 198-216.
15. Min Zhao, Liying Kang, G. J. Chang, Power domination in graphs, manuscript, Personal Communication.