IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v48y2024i4d10.1007_s10878-024-01207-w.html
   My bibliography  Save this article

The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs

Author

Listed:
  • Rahnuma Islam Nishat

    (Brock University)

  • Venkatesh Srinivasan

    (Santa Clara University)

  • Sue Whitesides

    (University of Victoria)

Abstract

An s, t Hamiltonian path P for an $$m \times n$$ m × n rectangular grid graph $$\mathbb {G}$$ G is a Hamiltonian path from the top-left corner s to the bottom-right corner t. We define an operation “square-switch” on s, t Hamiltonian paths P affecting only those edges of P that lie in some small (2 units by 2 units) square subgrid of $$\mathbb {G}$$ G . We prove that when applied to suitable locations, the result of the square-switch is another s, t Hamiltonian path. Then we use square-switch to achieve a reconfiguration result for a subfamily of s, t Hamiltonian paths we call simple paths, that has the minimum number of bends for each maximal internal subpath connecting any two vertices on the boundary of the grid graph. We give an algorithmic proof that the Hamiltonian path graph $$\mathcal {G}$$ G whose vertices represent simple paths is connected when edges arise from the square-switch operation: our algorithm reconfigures any given initial simple path P to any given target simple path $$P'$$ P ′ in $$\mathcal {O}$$ O ( $$ |P |$$ | P | ) time and $$\mathcal {O}$$ O ( $$ |P |$$ | P | ) space using at most $${5} |P |/ {4}$$ 5 | P | / 4 square-switches, where $$ |P |= m \times n$$ | P | = m × n is the number of vertices in the grid graph $$\mathbb {G}$$ G and hence in any Hamiltonian path P for $$\mathbb {G}$$ G . Thus the diameter of the simple path graph $$\mathcal {G}$$ G is at most 5mn/ 4 for the square-switch operation, which we show is asymptotically tight for this operation.

Suggested Citation

  • Rahnuma Islam Nishat & Venkatesh Srinivasan & Sue Whitesides, 2024. "The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs," Journal of Combinatorial Optimization, Springer, vol. 48(4), pages 1-48, November.
  • Handle: RePEc:spr:jcomop:v:48:y:2024:i:4:d:10.1007_s10878-024-01207-w
    DOI: 10.1007/s10878-024-01207-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01207-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/s10878-024-01207-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.

    References listed on IDEAS

    as
    1. Marthe Bonamy & Matthew Johnson & Ioannis Lignos & Viresh Patel & Daniël Paulusma, 2014. "Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 132-143, January.
    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. Takehiro Ito & Naonori Kakimura & Naoyuki Kamiyama & Yusuke Kobayashi & Yoshio Okamoto, 2019. "Reconfiguration of maximum-weight b-matchings in a graph," Journal of Combinatorial Optimization, Springer, vol. 37(2), pages 454-464, February.

    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:48:y:2024:i:4:d:10.1007_s10878-024-01207-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.

    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.