Extremal permutations in routing cycles

zbMath1351.05214arXiv1404.1851MaRDI QIDQ727043

Gexin Yu, Junhua He, Louis A. Valentin, Xiao-Yan Yin

Publication date: 6 December 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.1851

zbMATH Keywords

Cayley graphspermutationsorting algorithmrouting number

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes
• Permutations as Product of Parallel Transpositions
• Optimal Bounds for Matching Routing on Trees
• Routing Permutations on Graphs via Matchings

This page was built for publication: Extremal permutations in routing cycles