Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs (Q2299983)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear-time algorithms for finding Hamiltonian and longest (s,t)-paths in C-shaped grid graphs |
scientific article; zbMATH DE number 7172793
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs |
scientific article; zbMATH DE number 7172793 |
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
0.8623932003974915
0 references
0.8560270071029663
0 references
0.8535593152046204
0 references
0.8418499231338501
0 references
0.8100237846374512
0 references
