Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in
  Near-Linear Time   We give an O(n log^3 n) algorithm that, given an n-node directed planar graph
with arc capacities, a set of source nodes, and a set of sink nodes, finds a
maximum flow from the sources to the sinks. Previously, the fastest algorithms
known for this problem were those for general graphs.

26
The categories of this paper are: bayes-an
30
The categories of this paper are: q-alg
20
The categories of this paper are: acc-phys
35
The categories of this paper are: mtrl-th
18
The categories of this paper are: econ
11
The categories of this paper are: hep-lat
34
The categories of this paper are: chem-ph
10
The categories of this paper are: q-bio
36
The categories of this paper are: cmp-lg
27
The categories of this paper are: comp-gas
9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol
7
The categories of this paper are: hep-th
23
The categories of this paper are: solv-int
13
The categories of this paper are: quant-ph
5
The categories of this paper are: gr-qc