1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids.

Rahnuma Islam Nishat,Venkatesh Srinivasan,Sue Whitesides

International Conference and Workshops on Algorithms and Computation (WALCOM)（2022）

引用 2|浏览11

暂无评分

摘要

We give a complete structure theorem for 1-complex s , t Hamiltonian paths in rectangular grid graphs. We use the structure theorem to design an algorithm to reconfigure one such path into any other in linear time, making a linear number of switch operations in grid cells.

查看译文

关键词

hamiltonian paths

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要