IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v194y2022i2d10.1007_s10957-022-02035-w.html
   My bibliography  Save this article

The Maximum Clique Problem for Permutation Hamming Graphs

Author

Listed:
  • János Barta

    (IDSIA—USI/SUPSI)

  • Roberto Montemanni

    (University of Modena and Reggio Emilia)

Abstract

This paper explores a new approach to reduce the maximum clique problem associated with permutation Hamming graphs to smaller clique problems. The vertices of a permutation Hamming graph are permutations of n integers and the edges connect pairs of vertices at a Hamming distance greater than or equal to a threshold d. The maximum clique problem for permutation Hamming graphs is a challenging task due to the size, density and regularity of the graphs. However, symmetry properties, which are still partly unexplored, can help to reduce the problems’ size and hardness. A property of edge transitivity with respect to automorphisms is proven and leads to a classification for cycle-equivalent edges. This property enables to reduce the full-size clique problem to a set of significantly smaller (and easier to solve) clique problems. The number of reduced problems can be expressed by means of the partition function of integer numbers. Computational experiments confirm that additional knowledge on the automorphism group leads to a more targeted and efficient solving method for the maximum clique problem associated with permutation Hamming graphs.

Suggested Citation

  • János Barta & Roberto Montemanni, 2022. "The Maximum Clique Problem for Permutation Hamming Graphs," Journal of Optimization Theory and Applications, Springer, vol. 194(2), pages 492-507, August.
    • Handle: RePEc:spr:joptap:v:194:y:2022:i:2:d:10.1007_s10957-022-02035-w
    DOI: 10.1007/s10957-022-02035-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-022-02035-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-022-02035-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:194:y:2022:i:2:d:10.1007_s10957-022-02035-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.