{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:13Z","timestamp":1725663373957},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_54","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:32:27Z","timestamp":1330201947000},"page":"317-326","source":"Crossref","is-referenced-by-count":3,"title":["On the estimate of the size of a directed graph"],"prefix":"10.1007","author":[{"given":"A.","family":"Marchetti-Spaccamela","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Hall, M., D.E.Knuth, \"Combinatorial Analysis and Computers, part II\", American Mathematical Monthly, February 1965.","DOI":"10.1080\/00029890.1965.11970695"},{"key":"23_CR2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.2307\/2005469","volume":"29","author":"D. Knuth","year":"1975","unstructured":"Knuth, D., \"Estimating the Efficiency of Backtrack Programs\", Math. Comp. 29, pp. 121\u2013136, 1975.","journal-title":"Math. Comp."},{"key":"23_CR3","unstructured":"Marchetti-Spaccamela, A., \"Monte Carlo Estimates of the Size of Relations in Deductive Databases\", manuscript, 1988."},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0020-0190(87)90187-6","volume":"24","author":"L. Pitt","year":"1987","unstructured":"Pitt, L., \"A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graph\", Information Processing Letters vol. 24, pp.203\u2013206, 1987.","journal-title":"Information Processing Letters"},{"key":"23_CR5","unstructured":"Reingold, E.M., J. Nievergelt, N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice Hall, 1977."}],"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-50728-0_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:57:11Z","timestamp":1619571431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}