The Hamiltonian connectivity of rectangular supergrid graphs-Reference-Cited by-同舟云学术

The Hamiltonian connectivity of rectangular supergrid graphs

Published:2017-11 Issue: Volume:26 Page:41-65
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Hung Ruo-Wei,Li Chin-Feng,Chen Jong-Shin,Su Qing-Song

Funder

Ministry of Science and Technology, Taiwan

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference49 articles.

1. Hamiltonian Path Problems in the 0n-Line Optimization of Flexible Manufacturing Systems, Tech. Rep. TR 96-3;Ascheuer,1996

2. Computing the perceptual boundaries of dot patterns;O’Callaghan;Comput. Graphics Image Process.,1974

3. Hamiltonian graphs;Bermond,1978

4. Computational Geometry: An Introduction;Preperata,1985

5. G.T. Toussaint, Pattern recognition and geometrical complexity, in: Proceedings of the 5th International Conference on Pattern Recognition, Miami Beach, 1980, pp. 1324–1347.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hamiltonian (s, t)-paths in solid supergrid graphs;Computational and Applied Mathematics;2024-03-10

2. Paired restraint domination in extended supergrid graphs;The Journal of Supercomputing;2024-03-04

3. The Longest (s, t)-Path Problem on O-Shaped Supergrid Graphs;Mathematics;2023-06-15

4. Restrained domination and its variants in extended supergrid graphs;Theoretical Computer Science;2023-05

5. The Hamiltonicity and Hamiltonian-connectivity of Solid Supergrid Graphs;Bulletin of the Malaysian Mathematical Sciences Society;2023-04-24