Confluent Hasse Diagrams

DOI10.1007/978-3-642-25878-7_2zbMath1311.68116arXiv1108.5361OpenAlexW1908267767MaRDI QIDQ5895511

Joseph A. Simons, David Eppstein

Publication date: 9 March 2012

Published in: Graph Drawing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Drawing Order Diagrams Through Two-Dimension Extension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Confluent layered drawings
• Train tracks and confluent drawings
• Algorithms for plane representations of acyclic digraphs
• Transitive closure for restricted classes of partial orders
• Drawing orders using less ink
• Planar lattices and planar graphs
• Scheduling series-parallel orders subject to 0/1-communication delays
• Drawing and encoding two-dimensional posets
• A fast algorithm for building lattices
• Über eine Eigenschaft der Dedekind-MacNeilleschen Hülle
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Biclique Edge Cover Graphs and Confluent Drawings
• Fast algorithms for direct enclosures and direct dominances
• Planar Lattices
• Optimal Upward Planarity Testing of Single-Source Digraphs
• Upward Planar Drawing of Single-Source Acyclic Digraphs
• Partial orders of dimension 2
• Graph Drawing

This page was built for publication: Confluent Hasse Diagrams