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.
Title resolution pending
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
-
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.