Computing all-pairs shortest paths by leveraging low treewidth

Conference paper (2011)

Authors

L.R. Planken Algorithmics - EEMCS
M.M. de Weerdt Algorithmics - EEMCS
R.P.J. van der Krogt Data-Intensive Systems - EEMCS
Research Group
Algorithmics (EEMCS) (TU Delft)
More Info
expand_more

Published Date

2011

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Technology

Research Group

Algorithmics