Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Linear Time LexDFS on Chordal Graphs   Lexicographic Depth First Search (LexDFS) is a special variant of a Depth
First Search (DFS), which was introduced by Corneil and Krueger in 2008. While
this search has been used in various applications, in contrast to other graph
searches, no general linear time implementation is known to date. In 2014,
K\"ohler and Mouatadid achieved linear running time to compute some special
LexDFS orders for cocomparability graphs. In this paper, we present a linear
time implementation of LexDFS for chordal graphs. Our algorithm is able to find
any LexDFS order for this graph class. To the best of our knowledge this is the
first unrestricted linear time implementation of LexDFS on a non-trivial graph
class. In the algorithm we use a search tree computed by Lexicographic Breadth
First Search (LexBFS).

25
The categories of this paper are: patt-sol
10
The categories of this paper are: q-bio
5
The categories of this paper are: gr-qc
20
The categories of this paper are: acc-phys
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
26
The categories of this paper are: bayes-an
19
The categories of this paper are: eess
11
The categories of this paper are: hep-lat
24
The categories of this paper are: dg-ga
0
The categories of this paper are: hep-ph
21
The categories of this paper are: adap-org
15
The categories of this paper are: nucl-ex
33
The categories of this paper are: plasm-ph
22
The categories of this paper are: chao-dyn
17
The categories of this paper are: q-fin