Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Decomposition Algorithm for Median Graph of Triangulation of a Bordered
  2D Surface   This paper develops an algorithm that identifies and decomposes a median
graph of a triangulation of a 2-dimensional (2D) oriented bordered surface and
in addition restores all corresponding triangulation whenever they exist. The
algorithm is based on the consecutive simplification of the given graph by
reducing degrees of its nodes. From the paper \cite{FST1}, it is known that
such graphs can not have nodes of degrees above 8. Neighborhood of nodes of
degrees 8,7,6,5, and 4 are consecutively simplified. Then, a criterion is
provided to identify median graphs with nodes of degrees at most 3. As a
byproduct, we produce an algorithm that is more effective than previous known
to determine quivers of finite mutation type of size greater than 10.

24
The categories of this paper are: dg-ga
11
The categories of this paper are: hep-lat
22
The categories of this paper are: chao-dyn
37
The categories of this paper are: supr-con
30
The categories of this paper are: q-alg
34
The categories of this paper are: chem-ph
7
The categories of this paper are: hep-th
33
The categories of this paper are: plasm-ph
14
The categories of this paper are: math-ph
15
The categories of this paper are: nucl-ex
19
The categories of this paper are: eess
5
The categories of this paper are: gr-qc
23
The categories of this paper are: solv-int
8
The categories of this paper are: hep-ex
3
The categories of this paper are: physics
9
The categories of this paper are: nlin