Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A nonenumerative algorithm to find the k longest (shortest) paths in a
  DAG   In this paper, we present a novel and efficient algorithm to find the k
longest (shortest) paths between sources and sinks in a directed acyclic graph
(DAG). The algorithm does not enumerate paths therefore it is especially useful
for very large k values. It is based on the Valued-Sum-of-Product (VSOP) tool,
which is an extension of Zero-suppressed Binary Decision Diagrams (ZBDDs). We
assessed the performance of this algorithm with a DAG model of a path-intensive
combinational circuit, viz. c6288, that has \sim10^{20} paths. We found that it
took about 64 minutes to compute all paths in this DAG along with their
lengths.

31
The categories of this paper are: ao-sci
3
The categories of this paper are: physics
23
The categories of this paper are: solv-int
19
The categories of this paper are: eess
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
36
The categories of this paper are: cmp-lg
7
The categories of this paper are: hep-th
18
The categories of this paper are: econ
21
The categories of this paper are: adap-org
33
The categories of this paper are: plasm-ph
20
The categories of this paper are: acc-phys
11
The categories of this paper are: hep-lat
26
The categories of this paper are: bayes-an
2
The categories of this paper are: math