Algorithm computes k-dimensional dominance drawing of DAG G (width w_G) for w_G ≤ k ≤ n/2 in O(kn) time after O(km) precomputation of compressed transitive closure, plus new concepts and bounds.
World Wide Web 20(4), 677–696 (2017)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2019 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Multidimensional Dominance Drawings
Algorithm computes k-dimensional dominance drawing of DAG G (width w_G) for w_G ≤ k ≤ n/2 in O(kn) time after O(km) precomputation of compressed transitive closure, plus new concepts and bounds.
-
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.