Description
Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2011)]
| Date made available | 15 Mar 2011 |
|---|---|
| Publisher | TU Delft - 4TU.ResearchData |
| Date of data production | 15 Mar 2011 |
-
Computing all-pairs shortest paths by leveraging low treewidth
Planken, L., de Weerdt, M. & van der Krogt, P., 2012, In: The Journal of Artificial Intelligence Research. 43, p. 353-388 36 p.Research output: Contribution to journal › Article › Scientific › peer-review
-
Computing all-pairs shortest paths by leveraging low treewidth
Planken, L., de Weerdt, M. & van der Krogt, R., 2011, Proceedings 21st International Conference on Automated Planning and Scheduling. Helmert, M. & Edelkamp, S. (eds.). Palo Alto, CA, USA: American Association for Artificial Intelligence (AAAI), p. 170-177 8 p.Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review
Cite this
- DataSetCite