Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs

Rudolf Berghammer, Thorsten Hoffmann. Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs. In Harrie C. M. de Swart, editor, Relational Methods in Computer Science, 6th International Conference, RelMICS 2001, and 1st Workshop of COST Action 274 TARSKI Oisterwijk, The Netherlands, October 16-21, 2001, Revised Papers. Volume 2561 of Lecture Notes in Computer Science, pages 258-275, Springer, 2001. [doi]

Abstract

Abstract is missing.