F. Shahrokhi, L. A. Szekely, O. Sykora, and I. Vrt'o. Drawing graphs on surfaces with few crossings. Algorithmica, 16(1):118--131, July 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On k-Sets in Three Dimensions - Smorodinsky, Sharir (1999) (Correct)
....G i with ffi i vertices and t i edges. We assume that t i 4ffi i , otherwise, we omit p i from our calculations. Note that each crossing of a pair of edges in G i corresponds to a crossing of a pair of triangles in T that are incident to p i , and vice versa. Using the result of Shahrokhi et al. [12] on crossings in graphs we have that cr(G i ) the number of edge crossings in G i , is at least ct 3 i =ffi 2 i for some constant c (see also [11] Summing this inequality for all vertices in S for which t i 4ffi i , and using Holder s inequality, we get: cr(S; T ) n X i=1 cr(G i ) ....
F. Shahrokhi, L. A. Sz' ekely, O. S' ykora, and I. Vrt'o, Drawings of graphs on surfaces with few crossings, Algorithmica, 16 (1996), pp. 118--131. (special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia).
A Survey of Automated Layout Techniques for Information.. - Lok, Feiner (2001) (4 citations) (Correct)
No context found.
F. Shahrokhi, L. A. Szekely, O. Sykora, and I. Vrt'o. Drawing graphs on surfaces with few crossings. Algorithmica, 16(1):118--131, July 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC