Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs (Q2299983)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs |
scientific article |
Statements
Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs (English)
0 references
24 February 2020
0 references
grid graph
0 references
\(C\)-shaped grid graph
0 references
Hamiltonian \((s,t)\)-path
0 references
Hamiltonian cyclelongest \((s,t)\)-path
0 references
0 references
