Zobrazeno 1 - 1
of 1
pro vyhledávání: '"G��rerk, O��uz"'
For a given permutation $��_n$ in $S_n$, a random permutation graph is formed by including an edge between two vertices $i$ and $j$ if and only if $(i - j) (��_n(i) - ��_n (j)) < 0$. In this paper, we study various statistics of random pe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6785d05051b91ac402664499c773d825
