Genus, Treewidth, and Local Crossing Number

Dujmović, Vida and Eppstein, David and Wood, David R. (2015) Genus, Treewidth, and Local Crossing Number. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 87-98(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_8).

Full text not available from this repository.

Abstract

We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an n-vertex graph embedded on a surface of genus g with at most k crossings per edge has treewidth O(sqrt((g+1)(k+1)n)) and layered treewidth O((g+1)k), and that these bounds are tight up to a constant factor. As a special case, the k-planar graphs with n vertices have treewidth O(sqrt((k+1)n)) and layered treewidth O(k+1), which are tight bounds that improve a previously known O((k+1)^(3/4)n^(1/2)) treewidth bound. Additionally, we show that for g<m, every m-edge graph can be embedded on a surface of genus g with O((m/(g+1))log^(2)g) crossings per edge, which is tight to a polylogarithmic factor.

Item Type: Conference Paper
Classifications: G Algorithms and Complexity > G.420 Crossings
Z Theory > Z.001 General
Z Theory > Z.750 Topology
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 04 May 2016 16:18
Last Modified: 04 May 2016 16:18
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1480

Actions (login required)

View Item View Item