Print Email Facebook Twitter Computing All-Pairs Shortest Paths by Leveraging Low Treewidth (extended abstract) Title Computing All-Pairs Shortest Paths by Leveraging Low Treewidth (extended abstract) Author Planken, L.R. De Weerdt, M.M. Van der Krogt, R. Faculty Electrical Engineering, Mathematics and Computer Science Department Software Computer Technology Date 2011-11-03 To reference this document use: http://resolver.tudelft.nl/uuid:43311872-65c0-484f-ad26-7ad712e624a2 Source BNAIC 2011: 23rd Benelux Conference on Artificial Intelligence, Ghent, Belgium, 3-4 November 2011 Part of collection Institutional Repository Document type conference paper Rights (c) 2011 Planken, L.R.De Weerdt, M.M.Van der Krogt, R. Files PDF Planken_2011.pdf 143.92 KB Close viewer /islandora/object/uuid:43311872-65c0-484f-ad26-7ad712e624a2/datastream/OBJ/view