Abstract
The k-planar crossing number of a graph is the minimum number of crossings of its edges over all possible drawings of the graph in k planes. We propose algorithms and methods for k-planar drawings of general graphs together with lower bound techniques. We give exact results for the k-planar crossing number of K2k+1q, for k ≥ 2. We prove tight bounds for complete graphs. © Springer-Verlag 2004.
Cite
CITATION STYLE
Shahrokhi, F., Sýkora, O., Székely, L. A., & Vrt’O, I. (2004). Bounds and Methods for k-Planar Crossing Numbers. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2912, 37–46. https://doi.org/10.1007/978-3-540-24595-7_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
