Abstract
The problem of computing the chromatic polynomial of a graph is #P-hard. This paper presents an approximation algorithm for computing the chromatic polynomial of a graph. This algorithm has time complexity O(n 2 log n + nm 2) for a graph with n vertices and m edges. This paper also shows that the problem of computing the chromatic polynomial of a chordal graph can be solved in polynomial time. Knowledge about the chromatic polynomial of graphs can be employed to improve the performance of logic programs and deductive databases.
This work was supported in part by the National Science Foundation under grant number CCR-8901283.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. O. Allen, Probability, Statistics, and Queuing Theory With Computer Science Applications, Academic Press, Inc, 1990.
J. A. Bondy, “Bounds for the Chromatic Number of a Graph,” Journal of Combinatorial Theory 7, 1 (Jan. 1969), pp. 96–98.
S. K. Debray and N.-W. Lin, “Cost Analysis of Logic Programs,” to appear in ACM Transactions on Programming Languages and Systems.
G. A. Dirac, “On Rigid Circuit Graphs,” Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 25 (1961), pp. 71–76.
F. Gavril, “Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph,” SIAM Journal of Computing 1, 2 (June 1972), pp. 180–187.
M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
R. M. Karp, “Reducibility Among Combinatorial Problems,” Complexity of Computer Computations, edited by R. E. Miller and J. W. Thatcher, Plenum Press, New York, 1972, pp. 85–103.
D. J. Rose, “Triangulated Graphs and the Elimination Process,” Journal of Mathematical Analysis and Applications 32, (1970), pp. 597–609.
D. J. Rose, R. E. Tarjan and G. S. Lueker, “Algorithmic Aspects of Vertex Elimination,” SIAM Journal of Computing 5, 2 (June 1976), pp. 266–283.
D. E. Smith and M. R. Genesereth, “Ordering Conjunctive Queries,” Artificial Intelligence 26 (1985), pp. 171–215.
L. Stockmeyer, “On Approximation Algorithms for #P,” SIAM Journal on Computing 14, 4 (November 1985), pp. 849–861.
L. G. Valiant, “The Complexity of Computing the Permanent,” Theoretical Computer Science 8, (1979), pp. 189–201.
D. H. D. Warren, “Efficient Processing of Interactive Relational Database Queries Expressed in Logic”, Proc. Seventh International Conference on Very Large Data Bases, 1981, pp.272–281.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, NW. (1994). Approximating the chromatic polynomial of a graph. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1993. Lecture Notes in Computer Science, vol 790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57899-4_53
Download citation
DOI: https://doi.org/10.1007/3-540-57899-4_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57899-4
Online ISBN: 978-3-540-48385-4
eBook Packages: Springer Book Archive