Abstract
We characterize the complexity of the class of generalized coloring problems, denoted GCP F,k , which arise in resource allocation and VLSI theory. Depending on the parameters, this complexity ranges from polynomial to ∑ p2 -complete. The latter represent apparenly the first natural graph problems to be complete for any intermediate slot of the polynomial hyerarchy. A parallelizable algorithm for the polynomial problems is presented.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Berge, C. Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
Bollobás, B. Extremal Graph Theory, Academic Press, London, 1978.
Chaitin, G. J. Register Allocation and Spilling via Graph Coloring, SIGPLAN Not. (1982), vol. 17, no. 6, 98–105.
Garey, M. R. and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
Garey, M. R., D. S. Johnson, L. J. Stockmeyer. “Some Simplified NP-Complete Graph Problems”, Theoretical Computer Science 1 (1976), 237–267.
Holyer, I. “The NP-Completeness of Some Edge-Paritioning Problems”, SIAM J. Comput., 10 (1981), 713–717.
Karp, R. M. “Reducibility among Combinatorial Problems”, in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum, New York, 1972, 85–103.
Mansfield, A. “Topics in Computational Complexity”, Ph.D. Thesis, Univ. of Oxford., 1982.
Papadimitriou, C. H. and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, 1982.
Schaefer, T. J. “The Complexity of Satisfiability Problems”, Proceedings of the 10th ACM STOC, New York, 1978, 216–226.
Stockmeyer, L. J. “Polynomial-time Hierarchy”, Theor. Computer Science 3 (1977), 1–22.
Yannakakis, M. “Node-and Edge-Deletion NP-complete Problems”, Proceedings of the 10th ACM STOC, New York, 1978, 253–264.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rutenburg, V. (1986). Complexity of generalized graph coloring. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016284
Download citation
DOI: https://doi.org/10.1007/BFb0016284
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16783-9
Online ISBN: 978-3-540-39909-4
eBook Packages: Springer Book Archive