Algorithms for plane representations of acyclic digraphs
Theoretical Computer Science
Fast algorithms for direct enclosures and direct dominances
Journal of Algorithms
Partial-order transport service for multimedia and other applications
IEEE/ACM Transactions on Networking (TON)
Drawing and encoding two-dimensional posets
Ordal'94 Selected papers from the conference on Orders, algorithms and applications
Optimal Upward Planarity Testing of Single-Source Digraphs
SIAM Journal on Computing
Scheduling series-parallel orders subject to 0/1-communication delays
Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
A fast algorithm for building lattices
Information Processing Letters
Global partial orders from sequential data
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Upward Planar Drawing of Single-Source AcyclicDigraphs
SIAM Journal on Computing
On the Computational Complexity of Upward and Rectilinear Planarity Testing
SIAM Journal on Computing
Stepwise Construction of the Dedekind-MacNeille Completion (Research Note)
ICCS '98 Proceedings of the 6th International Conference on Conceptual Structures: Theory, Tools and Applications
Series-Parallel Posets: Algebra, Automata and Languages
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Upward Drawing on the Plane Grid Using Less Ink
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Algorithmica
Train Tracks and Confluent Drawings
Algorithmica
Biclique edge cover graphs and confluent drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
Multilevel agglomerative edge bundling for visualizing large graphs
PACIFICVIS '11 Proceedings of the 2011 IEEE Pacific Visualization Symposium
GD'05 Proceedings of the 13th international conference on Graph Drawing
| Hi-index | 0.00 |
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(n2) features, in an O(n) ×O(n) grid in O(n2) time. For the digraphs representing series-parallel partial orders we show how to construct a drawing with O(n) features in an O(n) ×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.