Drawing Order Diagrams Through Two-Dimension Extension

DOI10.7155/JGAA.00645MaRDI QIDQ6181952zbMATH OpenOpenAlexFDO

Authors Dominik Dürrschnabel, Tom Hanika, Gerd Stumme

Publication date 20 December 2023

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1906.06208

zbMATH Keywords

\texttt{DimDraw}graph drawingorder diagrams

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Combinatorics of partially ordered sets (06A07) Graph theory (including graph drawing) in computer science (68R10)

Abstract: 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.

Recommendations

• Order, genus, and diagram invariance
• scientific article; zbMATH DE number 432740
• Drawing orders using less ink
• Confluent Hasse Diagrams
• Confluent Hasse diagrams

Cites work

• Concept Lattices
• Confluent Hasse Diagrams
• Diametral pairs of linear extensions
• scientific article; zbMATH DE number 53952 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 5216733 (Why is no real title available?)
• scientific article; zbMATH DE number 6472574 (Why is no real title available?)
• On realizable biorders and the biorder dimension of a relation
• Overloaded orthogonal drawings
• Partially Ordered Sets
• Planar Lattices
• The approximation of maximum subgraph problems
• The complexity of comparability graph recognition and coloring
• The node-deletion problem for hereditary properties is NP-complete
• Theory and Applications of Satisfiability Testing
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints

Cited in

(3)

• Drawing and encoding two-dimensional posets
• Geometric representations of dichotomous ordinal data
• On computing optimal linear diagrams

This page was built for publication: Drawing Order Diagrams Through Two-Dimension Extension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181952)