Confluent Hasse diagrams

Details Confluent Hasse diagrams Confluent Hasse diagrams

2011-08-26

arxiv.org/abs/1108.5361v1

Computer Science

Computational Geometry

12 pages, 8 figures

Scientific paper

We show that a transitively reduced digraph has a confluent upward drawing if and only if its reachability relation has order dimension at most two. In this case, we construct a confluent upward drawing with $O(n^2)$ features, in an $O(n) \times O(n)$ grid in O(n^2) time. For the digraphs representing series-parallel partial orders we show how to construct a drawing with O(n) features in an $O(n) \times O(n)$ grid in O(n) time from a series-parallel decomposition of the partial order. Our drawings are optimal in the number of confluent junctions they use.

Affiliated with

Also associated with

No associations

Rating

Confluent Hasse diagrams does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Confluent Hasse diagrams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Confluent Hasse diagrams will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-502866