The maximum clique problem for permutation Hamming graphs

DOI10.1007/S10957-022-02035-WMaRDI QIDQ2156387zbMATH OpenOpenAlexFDO

Authors János Barta, Roberto Montemanni

Publication date 18 July 2022

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10957-022-02035-w

zbMATH Keywords

permutationscombinatoricsgraph theoryHamming graphsmaximum clique problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

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

• scientific article; zbMATH DE number 4068961 (Why is no real title available?)
• A new table of permutation codes
• Bounds for permutation arrays
• Constructing permutation arrays from groups
• Constructions for permutation codes in powerline communications
• Graph theoretic methods in coding theory
• New upper bounds for the size of permutation codes via linear programming
• On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
• On the maximum number of permutations with given maximal or minimal distance
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Upper bounds on permutation codes via linear programming

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)