Algebraic visualization of relations using REL VIEW

Authors:
Rudolf Berghammer;Gunther Schmidt
Affiliations:
Institut für Informatik, Christian-Albrechts-Universität Kiel, Kiel, Germany;Fakultät für Informatik, Universität der Bundeswehr München, Neubiberg, Germany
Venue:
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Year:
2007

Citing 6
Cited 0

DAG—a program that draws directed graphs

Software—Practice & Experience
An algorithm for drawing general undirected graphs

Information Processing Letters
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Implementation of Relational Algebra Using Binary Decision Diagrams

ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Theory and Applications of Relational Structures as Knowledge Instruments II: International Workshops of COST Action 274, TARSKI, 2002-2005, Selected Revised Papers (Lecture Notes in Computer Science)

Theory and Applications of Relational Structures as Knowledge Instruments II: International Workshops of COST Action 274, TARSKI, 2002-2005, Selected Revised Papers (Lecture Notes in Computer Science)
RelView: an OBDD-based computer algebra system for relations

CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

For graphs there exist highly elaborated drawing algorithms. We concentrate here in an analogous way on visualizing relations represented as Boolean matrices as, e.g., in RelView. This means rearranging the matrix appropriately, permuting rows and columns simultaneously or independently as required. In this way, many complex situations may successfully be handled in various application fields. We show how relation algebra and RelView can be combined to solve such tasks.