Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: From Invariants to Canonization in Parallel   A function $f$ of a graph is called a complete graph invariant if the
isomorphism of graphs $G$ and $H$ is equivalent to the equality $f(G)=f(H)$.
If, in addition, $f(G)$ is a graph isomorphic to $G$, then $f$ is called a
canonical form for graphs. Gurevich proves that graphs have a polynomial-time
computable canonical form exactly when they have a polynomial-time computable
complete invariant. We extend this equivalence to the polylogarithmic-time
model of parallel computation for classes of graphs with bounded rigidity index
and for classes of graphs with small separators. In particular, our results
apply to three representative classes of graphs embeddable into a fixed
surface, namely, to 5-connected graphs, to 3-connected graphs admitting a
polyhedral embedding, and 3-connected graphs admitting a large-edge-width
embedding. Another application covers graphs with bounded treewidth. Since in
the latter case an NC complete-invariant algorithm is known, we conclude that
graphs of bounded treewidth have a canonical form (and even a canonical
labeling) computable in NC.

15
The categories of this paper are: nucl-ex
24
The categories of this paper are: dg-ga
19
The categories of this paper are: eess
31
The categories of this paper are: ao-sci
30
The categories of this paper are: q-alg
27
The categories of this paper are: comp-gas
36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
5
The categories of this paper are: gr-qc
20
The categories of this paper are: acc-phys
35
The categories of this paper are: mtrl-th
32
The categories of this paper are: atom-ph
3
The categories of this paper are: physics
18
The categories of this paper are: econ
25
The categories of this paper are: patt-sol
12
The categories of this paper are: nucl-th