IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v38y2019i4d10.1007_s10878-019-00443-9.html
   My bibliography  Save this article

Node set optimization problem for complete Josephus cubes

Author

Listed:
  • Micheal Arockiaraj

    (Loyola College)

  • Jessie Abraham

    (KCG College of Technology)

  • Arul Jeya Shalini

    (Women’s Christian College)

Abstract

The problem of finding an optimal node set in an interconnection network plays an important role in minimizing the layout of embedding the network into linear chassis. In this paper we find the nested optimal node sets for a complete Josephus cube, a recently proposed fault-tolerant node cluster architecture variant of the binary hypercube which has the same number of nodes as the hypercube but exhibits enhanced embedding, fault tolerance and communications performance than the hypercube and many of its variants. As a byproduct we obtain the minimum layout of embedding the complete Josephus cube into a path, 1-rooted complete binary tree, sibling tree and caterpillar.

Suggested Citation

  • Micheal Arockiaraj & Jessie Abraham & Arul Jeya Shalini, 2019. "Node set optimization problem for complete Josephus cubes," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1180-1195, November.
  • Handle: RePEc:spr:jcomop:v:38:y:2019:i:4:d:10.1007_s10878-019-00443-9
    DOI: 10.1007/s10878-019-00443-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00443-9
    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/s10878-019-00443-9?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.

    References listed on IDEAS

    as
    1. Eduardo G. Pardo & Mauricio Soto & Christopher Thraves, 2015. "Embedding signed graphs in the line," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 451-471, February.
    2. Indra Rajasingh & Paul Manuel & M. Arockiaraj & Bharati Rajan, 2013. "Embeddings of circulant networks," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 135-151, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Eduardo G. Pardo & Antonio García-Sánchez & Marc Sevaux & Abraham Duarte, 2020. "Basic variable neighborhood search for the minimum sitting arrangement problem," Journal of Heuristics, Springer, vol. 26(2), pages 249-268, April.
    2. Sergio Cavero & Eduardo G. Pardo & Abraham Duarte, 2022. "A general variable neighborhood search for the cyclic antibandwidth problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 657-687, March.
    3. Julio Aracena & Christopher Thraves Caro, 2023. "The weighted sitting closer to friends than enemies problem in the line," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-21, January.
    4. S. Rajeshwari & M. Rajesh, 2023. "On Optimal Embeddings in 3-Ary n -Cubes," Mathematics, MDPI, vol. 11(7), pages 1-12, April.

    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:jcomop:v:38:y:2019:i:4:d:10.1007_s10878-019-00443-9. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.