pith. sign in

arxiv: 1108.1439 · v1 · pith:Z47BT3P7new · submitted 2011-08-06 · 💻 cs.DS · math.CO

Weak Dominance Drawings and Linear Extension Diameter

Evgenios M. Kornaropoulos , Ioannis G. Tollis This is my paper
classification 💻 cs.DS math.CO
keywords diameterdominanceextensionlinearweakacyclicboundscomplexity
0
0 comments X
read the original abstract

We introduce the problem of Weak Dominance Drawing for general directed acyclic graphs and we show the connection with the linear extension diameter of a partial order P. We present complexity results and bounds.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Multidimensional Dominance Drawings

    cs.DS 2019-06 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.