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.
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.
| Originalsprog | Engelsk |
|---|---|
| Tidsskrift | Nordic Journal of Computing |
| Vol/bind | 5 |
| Udgave nummer | 2 |
| Sider (fra-til) | 105-114 |
| ISSN | 1236-6064 |
| Status | Udgivet - 1998 |