Høyer, Peter; Larsen, Kim S. Parametric permutation routing via matchings. (English) Zbl 0905.68098 Nord. J. Comput. 5, No. 2, 105-114 (1998). 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. Cited in 1 Document MSC: 68R10 Graph theory (including graph drawing) in computer science 68M99 Computer system organization Keywords:permutation routing; matching; graph algorithm PDFBibTeX XMLCite \textit{P. Høyer} and \textit{K. S. Larsen}, Nord. J. Comput. 5, No. 2, 105--114 (1998; Zbl 0905.68098)