Drawing database schemas

DOI10.1002/spe.474zbMath1009.68921OpenAlexW2126430772MaRDI QIDQ4791031

Maurizio Pizzonia, Giuseppe Di Battista, Maurizio Patrignani, Walter Didimo

Publication date: 4 February 2003

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.474

zbMATH Keywords

graph drawingalgorithm engineeringorthogonal drawingupward drawingdatabase schema visualizationdrawing standard

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99) General topics in the theory of software (68N01)

Related Items (5)

HV-planarity: algorithms and complexity ⋮ Greedy rectilinear drawings ⋮ An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges ⋮ Orthogonal planarity testing of bounded treewidth graphs ⋮ Orthogonal drawings of graphs with vertex and edge labels

Uses Software

• LEDA

Cites Work

• Turn-regularity and optimal area drawings of orthogonal representations
• An experimental comparison of four graph drawing algorithms.
• A relational model of data for large shared data banks
• On the complexity of orthogonal compaction

This page was built for publication: Drawing database schemas