Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs.

Rudolf Berghammer Thorsten Hoffmann

Published in: RelMiCS (2001)

Keyphrases

strongly connected
directed graph
optimum path forest
undirected graph
relational databases
transitive closure
random walk
database
test cases
relational data
data model
graph matching
efficient computation
computer programs
graph theoretic