Parametric Permutation Routing via Matchings

Peter Høyer, Kim Skak Larsen

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Abstract

The problem of routing permutations on graphs via matchings is
considered, and we present a general algorithm which can be parameterized by
different heuristics. This leads to a framework which makes the analysis simple
and local.
OriginalsprogEngelsk
TidsskriftNordic Journal of Computing
Vol/bind5
Udgave nummer2
Sider (fra-til)105-114
ISSN1236-6064
StatusUdgivet - 1998

Fingeraftryk

Dyk ned i forskningsemnerne om 'Parametric Permutation Routing via Matchings'. Sammen danner de et unikt fingeraftryk.

Citationsformater