HIGHLIGHTS
- who: Ju00e1nos Barta from the Dalle Molle Institute for Artificial Intelligence, IDSIAu2014USI/SUPSI, Lugano, Switzerland Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia have published the paper: The Maximum Clique Problem for Permutation Hamming Graphs, in the Journal: (JOURNAL)
- what: With the following definitions, the authors focus on two types of permutations which will play an important role in this work: Definition 2.1 Let x u2208 u03a9n and let u03c0 u2208 Sn be a permutation of the symmetric group Sn. For the purpose of the work , the standard cycle . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.