Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Strongly connected orientation with minimum lexicographic order of
  indegrees   Given a simple undirected graph $G$, an orientation of $G$ is to assign every
edge of $G$ a direction. Borradaile et al gave a greedy algorithm
SC-Path-Reversal (in polynomial time) which finds a strongly connected
orientation that minimizes the maximum indegree, and conjectured that
SC-Path-Reversal is indeed optimal for the "minimizing the lexicographic order"
objective as well. In this note, we give a positive answer to the conjecture,
that is we show that the algorithm SC-PATH-REVERSAL finds a strongly connected
orientation that minimizes the lexicographic order of indegrees.

9
The categories of this paper are: nlin
0
The categories of this paper are: hep-ph
29
The categories of this paper are: funct-an
22
The categories of this paper are: chao-dyn
37
The categories of this paper are: supr-con
13
The categories of this paper are: quant-ph
4
The categories of this paper are: cond-mat
32
The categories of this paper are: atom-ph
24
The categories of this paper are: dg-ga
35
The categories of this paper are: mtrl-th
23
The categories of this paper are: solv-int
6
The categories of this paper are: astro-ph
14
The categories of this paper are: math-ph
17
The categories of this paper are: q-fin
28
The categories of this paper are: alg-geom
7
The categories of this paper are: hep-th