Hamiltonian (s, t)-paths in solid supergrid graphs

Hamiltonian (s, t)-paths in solid supergrid graphs

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 2 ) -ti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computational & applied mathematics 2024-04, Vol.43 (3), Article 110
Hauptverfasser: Keshavarz-Kohjerdi, Fatemeh, Bagheri, Alireza
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Apexes
Applications of Mathematics
Computational Mathematics and Numerical Analysis
Graph theory
Graphs
Mathematical Applications in Computer Science
Mathematical Applications in the Physical Sciences
Mathematics
Mathematics and Statistics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 2 ) -time algorithm where n is the number of the vertices of the input graph.
ISSN:2238-3603
1807-0302
DOI:10.1007/s40314-024-02614-9