Back to Search
Start Over
Hamiltonian (s, t)-paths in solid supergrid graphs.
- Source :
- Computational & Applied Mathematics; Apr2024, Vol. 43 Issue 3, p1-24, 24p
- Publication Year :
- 2024
-
Abstract
- The Hamiltonian path is a well-known NP-complete problem. This problem has been studied for solid supergrid graphs, in some special cases, and recently for 3-connected solid supergrid graphs. In this paper, we extend the previous result to general solid supergrid graphs, and present an O(n²)-time algorithm where n is the number of the vertices of the input graph. [ABSTRACT FROM AUTHOR]
- Subjects :
- HAMILTONIAN graph theory
NP-complete problems
GRAPH theory
Subjects
Details
- Language :
- English
- ISSN :
- 01018205
- Volume :
- 43
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Computational & Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 176827223
- Full Text :
- https://doi.org/10.1007/s40314-024-02614-9