Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar
  Graph and a Forest   1-planar graphs are graphs that can be drawn in the plane such that any edge
intersects with at most one other edge. Ackerman showed that the edges of a
1-planar graph can be partitioned into a planar graph and a forest, and claims
that the proof leads to a linear time algorithm. However, it is not clear how
one would obtain such an algorithm from his proof. In this paper, we first
reprove Ackerman's result (in fact, we prove a slightly more general statement)
and then show that the split can be found in linear time by using an
edge-contraction data structure by Holm et al.

36
The categories of this paper are: cmp-lg
28
The categories of this paper are: alg-geom
12
The categories of this paper are: nucl-th
14
The categories of this paper are: math-ph
6
The categories of this paper are: astro-ph
7
The categories of this paper are: hep-th
11
The categories of this paper are: hep-lat
5
The categories of this paper are: gr-qc
8
The categories of this paper are: hep-ex
31
The categories of this paper are: ao-sci
35
The categories of this paper are: mtrl-th
29
The categories of this paper are: funct-an
22
The categories of this paper are: chao-dyn
20
The categories of this paper are: acc-phys
17
The categories of this paper are: q-fin
25
The categories of this paper are: patt-sol