1 search results - page 1 / 1 » njc 1998 |
100
click to vote
NJC
1998
15 years 2 months ago
1998
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 ...