{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:20Z","timestamp":1725664040934},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578994"},{"type":"electronic","value":"9783540483854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_53","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:40:05Z","timestamp":1330263605000},"page":"200-210","source":"Crossref","is-referenced-by-count":1,"title":["Approximating the chromatic polynomial of a graph"],"prefix":"10.1007","author":[{"given":"Nai-Wei","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"18_CR1","unstructured":"A. O. Allen, Probability, Statistics, and Queuing Theory With Computer Science Applications, Academic Press, Inc, 1990."},{"issue":"1","key":"18_CR2","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/S0021-9800(69)80010-4","volume":"7","author":"J. A. Bondy","year":"1969","unstructured":"J. A. Bondy, \u201cBounds for the Chromatic Number of a Graph,\u201d Journal of Combinatorial Theory 7, 1 (Jan. 1969), pp. 96\u201398.","journal-title":"Journal of Combinatorial Theory"},{"key":"18_CR3","unstructured":"S. K. Debray and N.-W. Lin, \u201cCost Analysis of Logic Programs,\u201d to appear in ACM Transactions on Programming Languages and Systems."},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G. A. Dirac","year":"1961","unstructured":"G. A. Dirac, \u201cOn Rigid Circuit Graphs,\u201d Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 25 (1961), pp. 71\u201376.","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg"},{"issue":"2","key":"18_CR5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"F. Gavril, \u201cAlgorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph,\u201d SIAM Journal of Computing 1, 2 (June 1972), pp. 180\u2013187.","journal-title":"SIAM Journal of Computing"},{"key":"18_CR6","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980."},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp, \u201cReducibility Among Combinatorial Problems,\u201d Complexity of Computer Computations, edited by R. E. Miller and J. W. Thatcher, Plenum Press, New York, 1972, pp. 85\u2013103."},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"D. J. Rose","year":"1970","unstructured":"D. J. Rose, \u201cTriangulated Graphs and the Elimination Process,\u201d Journal of Mathematical Analysis and Applications 32, (1970), pp. 597\u2013609.","journal-title":"Journal of Mathematical Analysis and Applications"},{"issue":"2","key":"18_CR9","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. J. Rose","year":"1976","unstructured":"D. J. Rose, R. E. Tarjan and G. S. Lueker, \u201cAlgorithmic Aspects of Vertex Elimination,\u201d SIAM Journal of Computing 5, 2 (June 1976), pp. 266\u2013283.","journal-title":"SIAM Journal of Computing"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0004-3702(85)90028-1","volume":"26","author":"D. E. Smith","year":"1985","unstructured":"D. E. Smith and M. R. Genesereth, \u201cOrdering Conjunctive Queries,\u201d Artificial Intelligence 26 (1985), pp. 171\u2013215.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"18_CR11","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1137\/0214060","volume":"14","author":"L. Stockmeyer","year":"1985","unstructured":"L. Stockmeyer, \u201cOn Approximation Algorithms for #P,\u201d SIAM Journal on Computing 14, 4 (November 1985), pp. 849\u2013861.","journal-title":"SIAM Journal on Computing"},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L. G. Valiant","year":"1979","unstructured":"L. G. Valiant, \u201cThe Complexity of Computing the Permanent,\u201d Theoretical Computer Science 8, (1979), pp. 189\u2013201.","journal-title":"Theoretical Computer Science"},{"key":"18_CR13","unstructured":"D. H. D. Warren, \u201cEfficient Processing of Interactive Relational Database Queries Expressed in Logic\u201d, Proc. Seventh International Conference on Very Large Data Bases, 1981, pp.272\u2013281."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57899-4_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:09:36Z","timestamp":1619572176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}