Algorithms based on path and channel decomposition for reachability-focused hierarchical drawings of directed graphs, with experiments on bends, crossings, and clarity, running in O(kn+m) time.
IEEE Transactions on Systems, Man, and Cybernetics 11(2), 109–125 (1981)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Adventures in Abstraction: Reachability in Hierarchical Drawings
Algorithms based on path and channel decomposition for reachability-focused hierarchical drawings of directed graphs, with experiments on bends, crossings, and clarity, running in O(kn+m) time.