Peak memory minimization on Real Graph 700-1000-node graphs (test)
-73.45Gap from DP (%)Neural Topo Order (Beam search)
Evaluation Results
| Method | Links | |
|---|---|---|
| Neural Topo Order (Beam search)run time [s]=3.862022.07 | -73.45 | |
| Neural Topo Order (Greedy)run time [s]=0.832022.07 | -68.97 | |
| Neural Topo Order (Sample)run time [s]=0.972022.07 | -61.46 | |
| Breadth-first seq.run time [s]=4.862022.07 | -35.55 | |
| Approximated DPrun time [s]=1131.612022.07 | 0 | |
| Depth-First DPrun time [s]=3600, max. run time=1H2022.07 | 50.57 | |
| Random orderrun time [s]=2.42022.07 | 116.24 | |
| Depth-first seq.run time [s]=4.492022.07 | 123.21 |