Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs

Authors:
Rudolf Berghammer;Thorsten Hoffmann
Affiliations:
-;-
Venue:
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Year:
2001

Citing 6
Cited 0

Introduction to algorithms

Introduction to algorithms
Approximating the Minimum Equivalent Digraph

SIAM Journal on Computing
Combining relational calculus and the Dijkstra—Gries method for deriving relational programs

Information Sciences: an International Journal - Relational methods in computer science
A Discipline of Programming

A Discipline of Programming
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear Time

WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on a generic program for computing minimal sets, we present a simple relational program for computing transitive reductions of strongly connected directed graphs. It uses a precomputation phase and can easily be implemented in quadratic running time. The presentation is done as an exercise in generic programming and for combining the Dijkstra-Gries method and relational algebra to derive graph algorithms.