# Drawing Order Diagrams Through Two-Dimension Extension

arXiv: https://arxiv.org/abs/1906.06208 · HTML: https://mlsanity.com/paper/1906.06208/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Jun 2019.

## Built on by (most cited first, 4 of 4)

- [Attribute Selection using Contranominal Scales](https://mlsanity.com/paper/2106.10978/) (2021)
- [Discovering Locally Maximal Bipartite Subgraphs](https://mlsanity.com/paper/2211.10446/) (2022)
- [Maximal Ordinal Two-Factorizations](https://mlsanity.com/paper/2304.03338/) (2023)
- [Towards Ordinal Data Science](https://mlsanity.com/paper/2307.09477/) (2023)

## Abstract (arXiv)

Order diagrams are an important tool to visualize the complex structure of ordered sets. Favorable drawings of order diagrams, i.e., easily readable for humans, are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work we present the novel algorithm DimDraw to draw order diagrams. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of a corresponding graph.