2 search results - page 1 / 1 » Parametric Permutation Routing via Matchings |
NJC
1998
13 years 4 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 ...
STOC
1993
ACM
13 years 9 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...