Skip to main content
SpringerLink
Log in

Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11789))

Included in the following conference series:

Abstract

Given a pair of 1-complex Hamiltonian cycles C and \(C'\) in an L-shaped grid graph G, we show that one is reachable from the other under two operations, flip and transpose, while remaining in the family of 1-complex Hamiltonian cycles throughout the reconfiguration. Operations flip and transpose are local in G. We give a reconfiguration algorithm that uses O(|G|) operations.

R. I. Nishat—Travel supported by a grant from Faculty of Graduate Studies, University of Victoria.

S. Whitesides—Research supported in part by NSERC.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 74.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Afrati, F.: The hamilton circuit problem on grids. RAIRO - Theor. Inf. Appl. - Informatique Theorique et Applications 28(6), 567–582 (1994)

    Article  MathSciNet  Google Scholar 

  2. Arkin, E.M., Bender, M.A., Demaine, E.D., Fekete, S.P., Mitchell, J.S.B., Sethia, S.: Optimal covering tours with turn costs. SIAM J. Comput. 35(3), 531–566 (2005). https://doi.org/10.1137/S0097539703434267

    Article  MathSciNet  MATH  Google Scholar 

  3. des Cloizeaux, J., Jannik, G.: Polymers in Solution: Their Modelling and Structure. Clarendon Press, Oxford (1987)

    Google Scholar 

  4. Fellows, M., et al.: Milling a graph with turn costs: a parameterized complexity perspective. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 123–134. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16926-7_13

    Chapter  Google Scholar 

  5. Gopalan, P., Kolaitis, P.G., Maneva, E., Papadimitriou, C.H.: The connectivity of boolean satisfiability: computational and structural dichotomies. SIAM J. Comput. 38(6), 2330–2355 (2009)

    Article  MathSciNet  Google Scholar 

  6. Gorbenko, A., Popov, V., Sheka, A.: Localization on discrete grid graphs. In: He, X., Hua, E., Lin, Y., Liu, X. (eds.) Computer, Informatics, Cybernetics and Applications: CICA 2011. LNEE, vol. 107, pp. 971–978. Springer, Dordrecht (2012). https://doi.org/10.1007/978-94-007-1839-5_105

    Chapter  Google Scholar 

  7. Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676–686 (1982)

    Article  MathSciNet  Google Scholar 

  8. Ito, T., et al.: On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12), 1054–1065 (2011)

    Article  MathSciNet  Google Scholar 

  9. Jacobsen, J.L.: Exact enumeration of hamiltonian circuits, walks and chains in two and three dimensions. J. Phys. A: Math. Gen. 40, 14667–14678 (2007)

    Article  MathSciNet  Google Scholar 

  10. Keshavarz-Kohjerdi, F., Bagheri, A.: Hamiltonian paths in l-shaped grid graphs. Theor. Comput. Sci. 621, 37–56 (2016)

    Article  MathSciNet  Google Scholar 

  11. Mizuta, H., Ito, T., Zhou, X.: Reconfiguration of steiner trees in an unweighted graph. IEICE Trans. Fund. Electr. E100.A(7), 1532–1540 (2017)

    Article  Google Scholar 

  12. Muller, P., Hascoet, J.Y., Mognol, P.: Toolpaths for additive manufacturing of functionally graded materials (FGM) parts. Rapid Prototyp. J. 20(6), 511–522 (2014)

    Article  Google Scholar 

  13. Nishat, R.I., Whitesides, S.: Bend complexity and hamiltonian cycles in grid graphs. In: Cao, Y., Chen, J. (eds.) COCOON 2017. LNCS, vol. 10392, pp. 445–456. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-62389-4_37

    Chapter  MATH  Google Scholar 

  14. Bodroz̃a Pantić, O., Pantić, B., Pantić, I., Bodroz̃a Solarov, M.: Enumeration of hamiltonian cycles in some grid graphs. MATCH - Commun. Math. Comput. Chem. 70, 181–204 (2013)

    MathSciNet  MATH  Google Scholar 

  15. Pettersson, V.: Enumerating hamiltonian cycles. Electr. J. Comb. 21(4) (2014). P4.7

    Google Scholar 

  16. Takaoka, A.: Complexity of hamiltonian cycle reconfiguration. Algorithms 11(9), 140(15p) (2018)

    Article  MathSciNet  Google Scholar 

  17. Umans, C., Lenhart, W.: Hamiltonian cycles in solid grid graphs. In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, pp. 496–505 (1997)

    Google Scholar 

  18. Winter, S.: Modeling costs of turns in route planning. Geoinformatica 6(4), 345–361 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Victoria, Victoria, Canada

    Rahnuma Islam Nishat & Sue Whitesides

Authors
  1. Rahnuma Islam Nishat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sue Whitesides
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rahnuma Islam Nishat .

Editor information

Editors and Affiliations

  1. CNRS, LIRMM, Université de Montpellier, Montpellier, France

    Ignasi Sau

  2. CNRS, LIRMM, Université de Montpellier, Montpellier, France

    Dimitrios M. Thilikos

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nishat, R.I., Whitesides, S. (2019). Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs. In: Sau, I., Thilikos, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2019. Lecture Notes in Computer Science(), vol 11789. Springer, Cham. https://doi.org/10.1007/978-3-030-30786-8_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-30786-8_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-30785-1

  • Online ISBN: 978-3-030-30786-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation