Parametric permutation routing via matchings

Authors:
Peter Høyer;Kim S. Larsen
Affiliations:
Department of Mathematics and Computer Science, Odense University, Denmark;Department of Mathematics and Computer Science, Odense University, Denmark
Venue:
Nordic Journal of Computing
Year:
1998

Citing 5
Cited 0

Routing permutations on graphs via matchings

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Routing Permutations on Graphs Via Matchings

SIAM Journal on Discrete Mathematics
Optimal bounds for matching routing on trees

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Routing on Trees via Matchings

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Permutation Routing via Matchings

Permutation Routing via Matchings

Quantified Score

Hi-index	0.00

Visualization

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.