The longest path problem in odd-sized \(O\)-shaped grid graphs
DOI10.1142/s0129054123500065MaRDI QIDQ6492015
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
Publication date: 24 April 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Hamiltonian pathlongest pathgrid graphodd-sized \(O\)-shaped grid graphsrectangular grid graph with a rectangular hole
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
This page was built for publication: The longest path problem in odd-sized \(O\)-shaped grid graphs
