The following pages link to Drawing database schemas (Q4791031):
Displaying 7 items.
- Use of bipartite graphs as a notation for data bases (Q1259904) (← links)
- HV-planarity: algorithms and complexity (Q1628786) (← links)
- A heuristic algorithm for drawing of a flow diagram (Q1852305) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- Orthogonal drawings of graphs with vertex and edge labels (Q2573336) (← links)
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges (Q3611849) (← links)
- Greedy rectilinear drawings (Q5919678) (← links)