×

Parametric permutation routing via matchings. (English) Zbl 0905.68098

Summary: 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.

MSC:

68R10 Graph theory (including graph drawing) in computer science
68M99 Computer system organization
PDFBibTeX XMLCite