pith. sign in

Title resolution pending

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.DS 1

years

2019 1

verdicts

UNVERDICTED 1

representative citing papers

Multidimensional Dominance Drawings

cs.DS · 2019-06-21 · unverdicted · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Multidimensional Dominance Drawings cs.DS · 2019-06-21 · unverdicted · none · ref 12

    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.