Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Local 2-separators   How can sparse graph theory be extended to large networks, where algorithms
whose running time is estimated using the number of vertices are not good
enough? I address this question by introducing 'Local Separators' of graphs.
Applications include:
  1. A unique decomposition theorem for graphs along their local 2-separators
analogous to the 2-separator theorem;
  2. an exact characterisation of graphs with no bounded subdivision of a
wheel;
  3. an analogue of the tangle-tree theorem of Robertson and Seymour, where the
decomposition-tree is replaced by a general graph.

33
The categories of this paper are: plasm-ph
18
The categories of this paper are: econ
30
The categories of this paper are: q-alg
14
The categories of this paper are: math-ph
11
The categories of this paper are: hep-lat
13
The categories of this paper are: quant-ph
36
The categories of this paper are: cmp-lg
0
The categories of this paper are: hep-ph
23
The categories of this paper are: solv-int
25
The categories of this paper are: patt-sol
9
The categories of this paper are: nlin
15
The categories of this paper are: nucl-ex
17
The categories of this paper are: q-fin
1
The categories of this paper are: cs
26
The categories of this paper are: bayes-an
16
The categories of this paper are: stat