Unimaximal Sequences of Pairs in Rectangle Visibility DrawingStola, Jan (2009) Unimaximal Sequences of Pairs in Rectangle Visibility Drawing. In: Graph Drawing 16th International Symposium, GD 2008, September 21 24, 2008 , pp. 6166(Official URL: http://dx.doi.org/10.1007/9783642002199_7). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/9783642002199_7
AbstractWe study the existence of unimaximal subsequences in sequences of pairs of integers, e.g., the subsequences that have exactly one local maximum in each component of the subsequence. We show that 1 every sequence of 12 n2 (n2 − 1) + 1 pairs has a unimaximal subsequence of length n. We prove that this bound is tight. We apply this result to the problem of the largest complete graph with a 3D rectangle visibility representation and improve the upper bound from 55 to 50.
Actions (login required)
