Sciweavers

75
Voted
NJC
1998
86views more  NJC 1998»
15 years 1 days ago
Parametric Permutation Routing via Matchings
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 ...
Peter Høyer, Kim S. Larsen