Computing all-pairs shortest paths by leveraging low treewidth

Planken, LR; de Weerdt, MM; van der Krogt, RPJ

Computing all-pairs shortest paths by leveraging low treewidth

Conference paper (2011)

Authors

LR Planken Algorithmics

MM de Weerdt Algorithmics

RPJ van der Krogt Data-Intensive Systems

Research Group

Algorithmics

To reference this document use:

http://resolver.tudelft.nl/uuid:99e09c11-38fc-49d6-9754-c6d21ab762f7

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.

Research Group

Algorithmics

No files available

Metadata only record. There are no files for this conference paper.