{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:03:00Z","timestamp":1725487380078},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404385"},{"type":"electronic","value":"9783540450139"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45013-0_12","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:06:29Z","timestamp":1184587589000},"page":"144-157","source":"Crossref","is-referenced-by-count":2,"title":["A Generic Program for Minimal Subsets with Applications"],"prefix":"10.1007","author":[{"given":"Rudolf","family":"Berghammer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"R. Behnke et al. Applications of the Rel View system. In: R. Berghammer, Y. Lakhnech (eds.): Tool support for system specification, development and verification. Springer, pages 33\u201347, 1999.","DOI":"10.1007\/978-3-7091-6355-9_3"},{"key":"12_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/3-540-61042-1_38","volume-title":"Proc. 2nd Workshop on Tools and Applications for the Construction and Analysis of Systems","author":"R. Berghammer","year":"1996","unstructured":"R. Berghammer, B. von Karger, and C. Ulke. Relation-algebraic analysis of Petri nets with Rel View. In: T. Margaria, B. Steffen (eds.): Proc. 2nd Workshop on Tools and Applications for the Construction and Analysis of Systems, LNCS 1055, Springer, pages 49\u201369, 1996."},{"key":"12_CR3","unstructured":"T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to algorithms. The MIT Press, 1990."},{"key":"12_CR4","unstructured":"E.W. Dijkstra. A discipline of programming. Prentice-Hall, 1976."},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics 17:449\u2013467, 1965.","journal-title":"Canadian Journal of Mathematics"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"D. Gries. The science of computer programming. Springer, 1981.","DOI":"10.1007\/978-1-4612-5983-1"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/0406021","volume":"6","author":"P. Helman","year":"1993","unstructured":"P. Helman, B.M.E. Moret, H.D. Shapiro. An exact characterization of greedy structures. SIAM Journal Disc. Math. 6:274\u2013283, 1993.","journal-title":"SIAM Journal Disc. Math."},{"key":"12_CR8","unstructured":"D. Hochbaum (ed.). Approximation algorithms for NP-hard problems. PWS Publishing Company, 1995."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"J. Hopcroft and R. Tarjan. Efficient planarity testing. Journal of the ACM 21:549\u2013568, 1974.","journal-title":"Journal of the ACM"},{"key":"12_CR10","unstructured":"C. Kasper. 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":"12_CR11","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1137\/S0097539793256685","volume":"24","author":"S. Khuller","year":"1995","unstructured":"S. Khuller, B. Raghavachari, and N. Young. Approximating the minimum equivalent digraph. SIAM Journal of Computing 24:859\u2013972, 1995.","journal-title":"SIAM Journal of Computing"},{"key":"12_CR12","unstructured":"B. Leoniuk. ROBDD-based implementation of relations and relational operations with applications (in German). Ph.D. thesis, Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel, 2001."},{"key":"12_CR13","first-page":"434","volume":"7","author":"B.M.E. Moret","year":"2001","unstructured":"B.M.E. Moret and H.D. Shapiro. Algorithms and experiments: The new (and old) methodology. Journal of Universal Computer Science 7:434\u2013446, 2001.","journal-title":"Journal of Universal Computer Science"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"B.M.E. Moret. Towards a discipline of experimental algorithmics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (to appear).","DOI":"10.1090\/dimacs\/059\/10"},{"key":"12_CR15","unstructured":"C. Morgan and T. Vickers (eds.). On the refinement calculus. Formal Approaches to Computing and Information Technology, Springer, 1992."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF01920260","volume":"20","author":"H. Noltemeier","year":"1976","unstructured":"H. Noltemeier. Reduktion von Pr\u00e4zedenzstrukturen. Zeitschrift f\u00fcr Operations Research 20: 151\u2013159, 1976.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s002360050182","volume":"36","author":"J. Ravelo","year":"1999","unstructured":"J. Ravelo. Two graph algorithms derived. Acta Informatica 36:489\u2013510, 1999.","journal-title":"Acta Informatica"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"36","author":"R. Tamassia","year":"1989","unstructured":"R. Tamassia and T.G. Tollis. Planar grid embedding in linear time. IEEE Transactions on Circuits and Systems 36:1230\u20131234, 1989.","journal-title":"IEEE Transactions on Circuits and Systems"}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45013-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T18:09:37Z","timestamp":1550426977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45013-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404385","9783540450139"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45013-0_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}