Algorithms for plane representations of acyclic digraphs
Theoretical Computer Science
Upward planar drawing of single source acyclic digraphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Why looking isn't always seeing: readership skills and graphical programming
Communications of the ACM
Optimal Upward Planarity Testing of Single-Source Digraphs
SIAM Journal on Computing
Journal of the ACM (JACM)
Topological sorting of large networks
Communications of the ACM
Aris-Business Process Modeling
Aris-Business Process Modeling
Empirical Evaluation of Aesthetics-based Graph Layout
Empirical Software Engineering
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
Distributed and Parallel Databases
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Graph Layout for Workflow Applications with ILOG JViews
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Understanding Conceptual Schemas: Exploring the Role of Application and IS Domain Knowledge
Information Systems Research
Faster and More Focused Control-Flow Analysis for Business Process Models Through SESE Decomposition
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
The refined process structure tree
Data & Knowledge Engineering
A Simple Algorithm for Automatic Layout of BPMN Processes
CEC '09 Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing
What makes process models understandable?
BPM'07 Proceedings of the 5th international conference on Business process management
A Study Into the Factors That Influence the Understandability of Business Process Models
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
| Hi-index | 0.00 |
The layout of a business process model influences how easily it can be understood. Existing layout features in process modeling tools often rely on graph representations, but do not take the specific properties of business process models into account. In this paper, we propose an algorithm that is based on a set of constraints which are specifically identified toward establishing a readable layout of a process model. Our algorithm exploits the structure of the process model and allows the computation of the final layout in linear time. We explain the algorithm, show its detailed run-time complexity, compare it to existing algorithms, and demonstrate in an empirical evaluation the acceptance of the layout generated by the algorithm. The data suggests that the proposed algorithm is well perceived by moderately experienced process modelers, both in terms of its usefulness as well as its ease of use.