The maximum clique problem for permutation Hamming graphs
From MaRDI portal
Publication:2156387
DOI10.1007/S10957-022-02035-WzbMATH Open1495.90146OpenAlexW4280632586MaRDI QIDQ2156387FDOQ2156387
Authors: 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
Recommendations
- scientific article; zbMATH DE number 842876
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number
- Construction of Hamiltonian paths in graphs of permutation polyhedra
- scientific article; zbMATH DE number 22818
Cites Work
- Title not available (Why is that?)
- On the maximum number of permutations with given maximal or minimal distance
- Bounds for permutation arrays
- Constructions for permutation codes in powerline communications
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Upper bounds on permutation codes via linear programming
- New upper bounds for the size of permutation codes via linear programming
- A new table of permutation codes
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- Constructing permutation arrays from groups
- Graph theoretic methods in coding theory
This page was built for publication: The maximum clique problem for permutation Hamming graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2156387)
