Computing all-pairs shortest paths by leveraging low treewidth
Journal Article
(2012)
Author(s)
Léon Planken (TU Delft - Algorithmics)
Mathijs de Weerdt (TU Delft - Algorithmics)
PJ van der Krogt (External organisation)
Research Group
Algorithmics
To reference this document use:
https://resolver.tudelft.nl/uuid:ba0f87e7-b653-4a0e-99a6-993ad8287dac
More Info
expand_more
expand_more
Publication Year
2012
Language
English
Research Group
Algorithmics
Volume number
43
Pages (from-to)
353-388
No files available
Metadata only record. There are no files for this record.