The maximum clique problem for permutation Hamming graphs
From MaRDI portal
Publication:2156387
DOI10.1007/s10957-022-02035-wzbMath1495.90146OpenAlexW4280632586MaRDI QIDQ2156387
János Barta, Roberto Montemanni
Publication date: 18 July 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-022-02035-w
Cites Work
- Unnamed Item
- New upper bounds for the size of permutation codes via linear programming
- A new table of permutation codes
- On the maximum number of permutations with given maximal or minimal distance
- Bounds for permutation arrays
- Upper bounds on permutation codes via linear programming
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- Constructing permutation arrays from groups
- Constructions for permutation codes in powerline communications
- Graph Theoretic Methods in Coding Theory
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
This page was built for publication: The maximum clique problem for permutation Hamming graphs
