Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes

DOI10.1137/090776317zbMath1221.05212OpenAlexW2080385431MaRDI QIDQ3013141

Wei-Tian Li, Yiting Yang, Linyuan Lu

Publication date: 18 July 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090776317

zbMATH Keywords

parallel sorting algorithmrouting number

Mathematics Subject Classification ID

Searching and sorting (68P10) Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05) Parallel algorithms in computer science (68W10)

Related Items (2)

The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant ⋮ Extremal permutations in routing cycles

This page was built for publication: Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes