Extremal Permutations in Routing Cycles

Electronic Journal Of Combinatorics

Jinhua He¹ 

关键词: Routing number;    Permutation;    Sorting algorithm;    Cayley graphs;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Let $G$ be a graph whose vertices are labeled $1,\ldots,n$, and $\pi$ be a permutation on $[n]:=\{1,2,\ldots, n\}$. A pebble $p_i$ that is initially placed at the vertex $i$ has destination $\pi(i)$ for each $i\in [n]$. At each step, we choose a matching

【 授权许可】

Others