Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Data Reduction for Maximum Matching on Real-World Graphs: Theory and
  Experiments   Finding a maximum-cardinality or maximum-weight matching in (edge-weighted)
undirected graphs is among the most prominent problems of algorithmic graph
theory. For $n$-vertex and $m$-edge graphs, the best known algorithms run in
$\widetilde{O}(m\sqrt{n})$ time. We build on recent theoretical work focusing
on linear-time data reduction rules for finding maximum-cardinality matchings
and complement the theoretical results by presenting and analyzing (thereby
employing the kernelization methodology of parameterized complexity analysis)
new (near-)linear-time data reduction rules for both the unweighted and the
positive-integer-weighted case. Moreover, we experimentally demonstrate that
these data reduction rules provide significant speedups of the state-of-the art
implementations for computing matchings in real-world graphs: the average
speedup factor is 4.7 in the unweighted case and 12.72 in the weighted case.

7
The categories of this paper are: hep-th
6
The categories of this paper are: astro-ph
4
The categories of this paper are: cond-mat
35
The categories of this paper are: mtrl-th
13
The categories of this paper are: quant-ph
12
The categories of this paper are: nucl-th
32
The categories of this paper are: atom-ph
14
The categories of this paper are: math-ph
25
The categories of this paper are: patt-sol
31
The categories of this paper are: ao-sci
9
The categories of this paper are: nlin
36
The categories of this paper are: cmp-lg
24
The categories of this paper are: dg-ga
21
The categories of this paper are: adap-org
0
The categories of this paper are: hep-ph
26
The categories of this paper are: bayes-an