{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:16:57Z","timestamp":1762460217408},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003151"},{"type":"electronic","value":"9783540362807"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36280-0_18","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:16:50Z","timestamp":1187248610000},"page":"258-275","source":"Crossref","is-referenced-by-count":0,"title":["Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs"],"prefix":"10.1007","author":[{"given":"Rudolf","family":"Berghammer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"18_CR1","unstructured":"Aho A. V., Hopcroft J. E., Ullman J. D.: The design and analysis of computer algorithms. Addison-Wesley (1974)."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Behnke R. et al.: Applications of the Rel\n                              View system. In: Berghammer R., Lakhnech Y. (eds.): Tool support for system specification, development and verification. Advances in Computing, Springer, 33\u201347 (1999).","DOI":"10.1007\/978-3-7091-6355-9_3"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Berghammer R., Hoffmann T.: Relational depth-first-search with applications. In: Desharnais J. (ed.): Proc. 5th Int. Seminar on Relational Methods in Computer Science, Laval Univ., Dept. d\u2019Informatique, 11\u201320 (2000). Extended version in: Information Sciences 139, 167\u2013186 (2001).","DOI":"10.1016\/S0020-0255(01)00163-3"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0255(99)00012-2","volume":"119","author":"R. Berghammer","year":"1999","unstructured":"Berghammer R.: Combining relational calculus and the Dijkstra-Gries method for deriving relational programs. Information Sciences 119, 155\u2013171 (1999).","journal-title":"Information Sciences"},{"key":"18_CR5","unstructured":"Cormen T. H., Leiserson C. E., Rivest R. L.: Introduction to algorithms. The MIT Press (1990)."},{"key":"18_CR6","unstructured":"Dijkstra E. W.: A discipline of programming. Prentice-Hall (1976)."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Gries D.: The science of computer programming. Springer (1981).","DOI":"10.1007\/978-1-4612-5983-1"},{"key":"18_CR8","unstructured":"Hoffmann T.: Case studies in relational program development by selected strategies for graph searching (in German). Ph.D. thesis, Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel (2002)."},{"key":"18_CR9","unstructured":"Kasper C.: Investigating algorithms for transitive reductions and minimum equivalent digraphs (in German). Diploma thesis, Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel (2001)."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1137\/S0097539793256685","volume":"24","author":"S. Khuller","year":"1995","unstructured":"Khuller S., Raghavachari B., Young N.: Approximating the minimum equivalent digraph. SIAM Journal on Computing 24, 859\u2013972 (1995).","journal-title":"SIAM Journal on Computing"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF01920260","volume":"20","author":"H. Noltemeier","year":"1976","unstructured":"Noltemeier H.: Reduktion von Pr\u00e4zedenzstrukturen. Zeitschrift f\u00fcr Operations Res. 20, 151\u2013159 (1976).","journal-title":"Zeitschrift f\u00fcr Operations Res"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s002360050182","volume":"36","author":"J. Ravelo","year":"1999","unstructured":"Ravelo J.: Two graph algorithms derived. Acta Informatica 36, 489\u2013510 (1999).","journal-title":"Acta Informatica"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Schmidt G., Str\u00f6hlein T.: Relations and graphs. Springer (1993).","DOI":"10.1007\/978-3-642-77968-8"},{"key":"18_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/3-540-52292-1_18","volume-title":"Finding a minimal transitive reduction in a strongly connected digraph within linear time","author":"K. Simon","year":"1990","unstructured":"Simon K.: Finding a minimal transitive reduction in a strongly connected digraph within linear time. In: Nagl M. (ed.): Proc. 15th Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 411, Springer, 245\u2013259 (1990)."}],"container-title":["Lecture Notes in Computer Science","Relational Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36280-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T06:36:33Z","timestamp":1547879793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36280-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003151","9783540362807"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-36280-0_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}