Drawing orders using less ink

DOI10.1007/BF00419035zbMath0769.06001OpenAlexW1985414400MaRDI QIDQ1205151

A. Aeschlimann, Juerg Schmid

Publication date: 1 April 1993

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00419035

zbMATH Keywords

finite partially ordered setsHasse-diagramrectangular planar grid

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Partial orders, general (06A06) Software, source code, etc. for problems pertaining to ordered structures (06-04)

Related Items (2)

Drawing and encoding two-dimensional posets ⋮ Confluent Hasse Diagrams

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of minimizing wire lengths in VLSI layouts
• The complexity of drawing trees nicely
• Crooked diagrams with few slopes
• Orders with level diagrams
• Lattice diagrams with few slopes
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• An Inductive Algorithm to Construct Finite Lattices
• Einfluß und Kompensation von Lose und Coulombscher Reibung bei einem drehzahl- und lagegeregelten, elastischen Zweimassensystem

This page was built for publication: Drawing orders using less ink