On the complexity of kings

Theoretical Computer Science

Volumn 411, Issue 4-5, 2010, Pages 783-798

  Hemaspaandra, Edith ^a   Hemaspaandra, Lane A ^b   Tantau, Till ^c   Watanabe, Osamu ^d  

^a Rochester Institute of Technology   (United States)

^b University of Rochester   (United States)

^c UNIVERSITY OF LÜBECK   (Germany)

^d TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Diameter; Kings; Polynomial hierarchy; Succinct representations; Tournaments

Indexed keywords

DIAMETER PROBLEM; DIRECTED GRAPHS; NP-HARD; POLYNOMIAL HIERARCHIES; REACHABILITY PROBLEM; SUCCINCT REPRESENTATION; THEORETICAL COMPUTER SCIENCE;

COMPUTATIONAL COMPLEXITY;

GRAPH THEORY;

EID: 72949083069     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.10.015     Document Type: Article

References (23)

1. Bang-Jensen J., and Gutin G. Generalizations of tournaments: A survey. Journal of Graph Theory 28 4 (1998) 171-202
2. Faliszewski P., Hemaspaandra E., Hemaspaandra L., and Rothe J. Llull and Copeland voting computationally resist bribery and control. Journal of Artificial Intelligence Research 35 (2009) 275-341
3. Galperin H., and Wigderson A. Succinct representations of graphs. Information and Control 56 3 (1983) 183-198
4. Garey M., and Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W. H. Freeman and Company
5. Gutin G. The radii of n-partite tournaments. Mathematical Notes 40 (1986) 414-417
6. E. Hemaspaandra, L. Hemaspaandra, T. Tantau, O. Watanabe, On the complexity of kings. Technical Report URCS-TR905, Department of Computer Science, University of Rochester, Rochester, NY, USA, December 2006. Revised, November 2007
7. Hemaspaandra L., Nasipak C., and Parkins K. A note on linear-nondeterminism, linear-sized, Karp-Lipton advice for the P-selective sets. Journal of Universal Computer Science 4 8 (1998) 670-674
8. Hemaspaandra L., Ogihara M., Zaki M., and Zimand M. The complexity of finding top-Toda-equivalence-class members. Theory of Computing Systems 39 5 (2006) 669-684
9. Hemaspaandra L., and Torenvliet L. P-selectivity, immunity, and the power of one bit. Proceedings of the 32nd International Conference on Current Trends in Theory and Practice of Computer Science. Lecture Notes in Computer Science vol. 3881 (2006), Springer-Verlag 323-331
10. Landau H. On dominance relations and the structure of animal societies, III: The condition for score structure. Bulletin of Mathematical Biophysics 15 2 (1953) 143-148
11. Meyer A., and Stockmeyer L. The equivalence problem for regular expressions with squaring requires exponential space. Proceedings of the 13th IEEE Symposium on Switching and Automata Theory (1972), IEEE Press 125-129
12. Nickelsen A., and Tantau T. The complexity of finding paths in graphs with bounded independence number. SIAM Journal on Computing 34 5 (2005) 1176-1195
13. Petrovic V., and Thomassen C. Kings in k-partite tournaments. Discrete Mathematics 98 (1991) 237-238
14. Schaefer M., and Umans C. Completeness in the polynomial-time hierarchy: Part I: A compendium. SIGACT News 33 3 (2002)
15. Schaefer M., and Umans C. Completeness in the polynomial-time hierarchy: Part II. SIGACT News 33 4 (2002)
16. Selman A. P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP. Mathematical Systems Theory 13 1 (1979) 55-65
17. Selman A. Some observations on NP real numbers and P-selective sets. Journal of Computer and System Sciences 23 3 (1981) 326-332
18. Selman A. Reductions on NP and P-selective sets. Theoretical Computer Science 19 3 (1982) 287-304
19. Stockmeyer L. The polynomial-time hierarchy. Theoretical Computer Science 3 1 (1976) 1-22
20. Stockmeyer L., and Meyer A. Word problems requiring exponential time. Proceedings of the 5th ACM Symposium on Theory of Computing (1973), ACM Press 1-9
21. T. Tantau, Complexity of the undirected radius and diameter problems for succinctly represented graphs. Technical Report SIIM-TR-A-08-03, Universität zu Lübeck, Lübeck, Germany, 2008
22. West D. Introduction to Graph Theory. 2nd edition (2001), Prentice-Hall
23. Wrathall C. Complete sets and the polynomial-time hierarchy. Theoretical Computer Science 3 1 (1976) 23-33