{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:49:46Z","timestamp":1725662986638},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540095262"},{"type":"electronic","value":"9783540350880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1007\/3-540-09526-8_27","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:47:07Z","timestamp":1330188427000},"page":"301-307","source":"Crossref","is-referenced-by-count":29,"title":["A reduct-and-closure algorithm for graphs"],"prefix":"10.1007","author":[{"given":"Alla","family":"Goral\u010d\u00edkov\u00e1","sequence":"first","affiliation":[]},{"given":"V\u00e1clav","family":"Koubek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"issue":"2","key":"27_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"A. V. Aho","year":"1972","unstructured":"A. V. Aho, M. R. Garey, J. D. Ullman, The transitive reduction of a directed graph, SIAM J. Comput., 1:2(1972), 131\u2013137.","journal-title":"SIAM J. Comput."},{"key":"27_CR2","unstructured":"A. V. Aho, J. E. Hopcroft, J. D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, 1974."},{"key":"27_CR3","unstructured":"G. Birkhoff, Lattice theory, Amer. Math. Soc., vol. XXV (1967)."},{"key":"27_CR4","unstructured":"M. Demlov\u00e1, J. Demel, V. Koubek, Several algorithms for finite algebras, to appear in FCT 1979."},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"M. J. Fischer, A. R. Meyer, Boolean matrix multiplication and transitive closure, IEEE 12th Annual Symposium on Switching and Automata Theory (1971), 129\u2013131.","DOI":"10.1109\/SWAT.1971.4"},{"issue":"3","key":"27_CR6","first-page":"172","volume":"20","author":"H. B. Hunt III","year":"1977","unstructured":"H. B. Hunt III, T. G. Szymanski, J. D. Ullman, Operations on sparse relations, Comm. ACM 20:3(1977), 172\u2013176.","journal-title":"Comm. ACM"},{"issue":"2","key":"27_CR7","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. E. Tarjan","year":"1972","unstructured":"R. E. Tarjan, Depth first search and linear graph algorithms, SIAM J. Comput.,1:2(1972), 146\u2013160.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1979"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-09526-8_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:01:25Z","timestamp":1605643285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-09526-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"ISBN":["9783540095262","9783540350880"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-09526-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1979]]}}}