Weak Dominance Drawings and Linear Extension Diameter
Data Structures and Algorithms
2011-08-09 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.1108.1439,
title = {Weak Dominance Drawings and Linear Extension Diameter},
author = {Evgenios M. Kornaropoulos and Ioannis G. Tollis},
journal= {arXiv preprint arXiv:1108.1439},
year = {2011}
}
Comments
7 pages