Confluent Hasse Diagrams

DOI10.7155/jgaa.00312zbMath1276.05052OpenAlexW3104980453MaRDI QIDQ5891340

David Eppstein, Joseph A. Simons

Publication date: 28 November 2013

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

Full work available at URL: https://doi.org/10.7155/jgaa.00312

zbMATH Keywords

confluent upward drawingtransitively reduced digraph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

On Strict (Outer-)Confluent Graphs ⋮ Approximating the Bundled Crossing Number ⋮ \(st\)-orientations with few transitive edges ⋮ $st$-Orientations with Few Transitive Edges ⋮ On strict (outer-)confluent graphs ⋮ Crossing Layout in Non-planar Graph Drawings

This page was built for publication: Confluent Hasse Diagrams